InsertionSort.java

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

    static void sort(int arr[], int n){
        int j, temp;
        for(int i=1;i<n;i++){
            temp = arr[i];
            j = i-1;
            while(j>=0 && arr[j]>temp){
                arr[j+1] = arr[j];
                j--;
            }
            System.out.println(j);
            arr[j+1] = temp;
            for(j=0;j<n;j++){
                System.out.print(arr[j]+" ");
            }
            System.out.println();
        }
    }
    
}