SelectionSort.java

import java.util.Scanner;
/*
 * ---------------
 * Time Complexity
 * Best, Average, Worst Case = O(n^2)
 * ---------------
 */
class SelectionSort{
    public static void main(String []args){
        int i, size;
        try (Scanner scan = new Scanner(System.in)) {
            System.out.println("Enter the size of the array:");
            size = scan.nextInt();
            int arr[] = new int[size];
            System.out.println("Enter the elements: ");
            for(i=0;i<size;i++){
                arr[i] = scan.nextInt();
            }
            sort(arr,size);
            for(i=0;i<size;i++){
                System.out.print(arr[i]+" ");
            }
        }
    }
    static void sort(int arr[], int n){
        int i, j, index, temp;
        for(i=0;i<n-1;i++){
            index = i;
            for(j=i+1;j<n;j++){
                /*Key Logic*/
                if(arr[j] < arr[index]){
                    index = j;
                }
            }
            temp = arr[index];
            arr[index] = arr[i];
            arr[i] = temp;
        }
    }
}