TheAlgorithms · ghost · Oct 9, 2017 · Oct 10, 2017 · Oct 10, 2017
@@ -1,6 +1,6 @@
 /**
  *
- * @author Varun Upadhyay (https://github.com/varunu28)
+ * @author Shubham Singh (https://github.com/ss3681755) 
  *
  */
 
@@ -9,55 +9,27 @@ class InsertionSort {
     /**
      * This method implements the Generic Insertion Sort
      *
-     * @param array The array to be sorted 
-     * @param last The count of total number of elements in array
+     * @param initialArray The array to be sorted 
      * Sorts the array in increasing order
      **/
 
-    public static <T extends Comparable<T>> void IS(T array[], int last) {
-        T key;
-        for (int j=1;j<last;j++) {
-
-            // Picking up the key(Card)
-            key = array[j];
-            int i = j-1;
-            while (i>=0 && key.compareTo(array[i]) < 0) {
-                array[i+1] = array[i];
-                i--;
-            }
-            // Placing the key (Card) at its correct position in the sorted subarray
-            array[i+1] = key;
-        }
-    }
-
-    // Driver Program
-    public static void main(String[] args) {
-        // Integer Input
-        int[] arr1 = {4,23,6,78,1,54,231,9,12};
-        int last = arr1.length;
-        Integer[] array = new Integer[arr1.length];
-        for (int i=0;i<arr1.length;i++) {
-            array[i] = arr1[i];
-        }
-
-        IS(array, last);
+    public static <T extends Comparable<T>> void sort(T[] initialArray) {
+    	for (int index = 1; index < initialArray.length; index++) {
 
-        // Output => 1 4 6 9 12 23 54 78 231
-        for (int i=0;i<array.length;i++) {
-            System.out.print(array[i] + " ");
-        }
-        System.out.println();
+    		// Picking up the key
+    		T key = initialArray[index];
+    		int previousIndex = index - 1;
 
-        // String Input
-        String[] array1 = {"c", "a", "e", "b","d"};
-        last = array1.length;
+    		// Keep on comparing key with its previous elements until all 
+    		// the elements till a particular index are sorted.
+    		while(previousIndex >= 0 && key.compareTo(initialArray[previousIndex]) <= 0) {
+    			initialArray[previousIndex + 1] = initialArray[previousIndex];
+    			previousIndex -= 1;
+    		}
 
-        IS(array1, last);
-
-        //Output => a	b	c	d	e
-        for(int i=0; i<last; i++)
-        {
-            System.out.print(array1[i]+"\t");
-        }
+    		// Copy the key to index before which all the elements are sorted.
+    		initialArray[previousIndex + 1] = key;
+    	}
     }
+
 }