Class InsertionSort

2_Basic Sorting/InsertionSort.java:5–47

//Problem : Insertion Sort

public class InsertionSort {
    public static void insertionSort(int arr[]) {
       for(int i=1; i<arr.length; i++) {
           int curr = arr[i];
           int prev = i-1;
           //to find the index where curr is to be inserted
           while(prev >= 0 && arr[prev] > curr) {
               arr[prev+1] = arr[prev];
               prev--;
           }
           arr[prev+1] = curr;
       }
    }

    public static void insertionSortDescending(int arr[]) {
        for(int i=1; i<arr.length; i++) {
            int curr = arr[i];
            int prev = i-1;
            //to find the index where curr is to be inserted
            while(prev >= 0 && arr[prev] < curr) {
                arr[prev+1] = arr[prev];
                prev--;
            }
            arr[prev+1] = curr;
        }
     }

    public static void printArr(int arr[]) {
        for(int i=0; i<arr.length; i++) {
            System.out.print(arr[i]+" ");
        }
        System.out.println();
    }
   
    public static void main(String args[]) {
        int arr[] = {5, 4, 1, 3, 2};
        insertionSortDescending(arr);
        printArr(arr);

        //Inbuilt Sorting Algo
        //Arrays.sort(arr);
    }
}