Selection sort

SelectionSort.java

package search_sort;

import java.util.Scanner;

/**
 * 
Selection sort O(n2):
Find the minimum by scanning the array
Swap it with the first element
Increment index and repeat with the remaining part of the array

 */
public class SelectionSort {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] array = new int[n];
        for (int i = 0; i < n; i++) {
            array[i] = scanner.nextInt();
        }
        array = getArraySorted(array);
        for (int i : array) {
            System.out.print(i + " ");
        }
    }

    private static int[] getArraySorted(int[] array) {
        for (int i = 0; i < array.length; i++) {
            int smallestIndex = findSmallest(array, i);
            array = swap(array, i, smallestIndex);

        }
        return array;
    }

    private static int findSmallest(int[] array, int i) {
        int smallestIndex = i;
        for (int j = i + 1; j < array.length; j++) {
            if (array[smallestIndex] > array[j]) {
                smallestIndex = j;
            }
        }
        return smallestIndex;
    }

    private static int[] swap(int[] array, int i, int j) {
        int temp = array[i];
        array[i] = array[j];
        array[j] = temp;
        return array;
    }
}