insertionSort

public class InsertionSorter {
    public static int sort(int[] randi) {
        if (randi == null || randi.length == 0) {
            return 0;
        }
        int count = 0;
        //int n = randi.length; 
        for (int i = 1; i < randi.length; ++i) { 
            int pivot = randi[i]; 
            int j = i - 1; 
            while (j >= 0 && randi[j] > pivot) {
                count++;
                randi[j + 1] = randi[j]; 
                j = j - 1; 
            } 
            randi[j + 1] = pivot; 
        }
        System.out.println("count: " + count);
        System.out.println();
        return count;
    }
    static void printArray(int arr[]) 
    { 
        //int n = arr.length; 
        for (int i = 0; i < arr.length; ++i) 
            System.out.print(arr[i] + " "); 
  
        System.out.println(); 
    } 
  
    // Driver method 
    public static void main(String args[]) 
    { 
        int arr[] = { 12, 11, 13, 5, 6, 8, 20 }; 
  
        InsertionSorter ob = new InsertionSorter(); 
        ob.sort(arr); 
  
        printArray(arr); 
    } 
}