Updated

Author: jeyrschabu

insertion_sort.md

@@ -1,26 +1,22 @@
 Insertion Algorithm
 ========================
+- Stable
+- O(1) extra space
+- O(n2) comparisons and swaps
+- Adaptive: O(n) time when nearly sorted
+- Very low overhead
 
-Implementations:
-
-[INSERTIONSORT]
-
-```
-//Stable
-//O(1) extra space
-//O(n2) comparisons and swaps
-//Adaptive: O(n) time when nearly sorted
-//Very low overhead
+```java
 void insertionSort(int [] numbers) {
     for(int i = 1; i < numbers.length; i++) {
         int val = numbers[i];
         int j = i - 1;
-        while(j >= 0 && numbers[j] > val){
+        while (j >= 0 && numbers[j] > val) {
             numbers[j + 1] = numbers[j];
             j--;
         }
+
         numbers[j + 1] = val;
     }
 }
-```
-[/INSERTIONSORT]
+```