Selection Sort

Given an array of integers, sort the elements in the array in ascending order. The selection sort algorithm should be used to solve this problem.

Examples

• {1} is sorted to {1}
• {1, 2, 3} is sorted to {1, 2, 3}
• {3, 2, 1} is sorted to {1, 2, 3}
• {4, 2, -3, 6, 1} is sorted to {-3, 1, 2, 4, 6}

Corner Cases

• What if the given array is null? In this case, we do not need to do anything.
• What if the given array is of length zero? In this case, we do not need to do anything.

public class SelectionSort {

    public int SelectionSort(int[] array){
        if (array == null || array.length = 0){
            return array;
        }
        int index = i;
        for ( i = 0; i <= array.length; i++){
            for (j = i + 1, j <= array.length; j++) {
                if (array[j] < array[index]) {
                index = j;
            }
            int tem = array[index];
            array[index] = array[j];
            array[j] = tem;
             }
        }return array;
 
}
}