Insertion sort code comment and doc updated

Author: me-shaon

Sorting/Insertion Sort/README.md

@@ -2,17 +2,19 @@
 
 **Insertion sort** does exactly what you would expect: it inserts each element of the array into its proper position, leaving progressively larger stretches of the array sorted. What this means in practice is that the sort iterates down an array, and the part of the array already covered is in order; then, the current element of the array is inserted into the proper position at the head of the array, and the rest of the elements are moved down, using the space just vacated by the element inserted as the final space.
 
+
 ![Insertion Sort](insertion_sort.jpg)
 
 
-#####A visualization on Insertion Sort
+#### A visualization on Insertion Sort
 ![Insertion sort demonstration](https://upload.wikimedia.org/wikipedia/commons/0/0f/Insertion-sort-example-300px.gif)
 
 
-####Complexity Analysis
-- Worst Case - О(n<sup>2</sup>) comparisons, swaps
-- Average Case - О(n<sup>2</sup>) comparisons, swaps
-- Best Case - O(n) comparisons, O(1) swaps
+#### Complexity Analysis
+- Worst Case - О(n<sup>2</sup>)
+- Average Case - О(n<sup>2</sup>)
+- Best Case - O(n)
+
 ### More on this topic
 - https://en.wikipedia.org/wiki/Insertion_sort
 - http://quiz.geeksforgeeks.org/insertion-sort/

Sorting/Insertion Sort/insertion-sort.js

@@ -1,23 +1,22 @@
-//Insertion sort implementation
-function insertionSort(arr){
-    var len = arr.length;
-
-    for(var i=1; i<len; i++){
-       currentValue = arr[i];
-       j = i-1;
-
-       /* Move elements of arr[0..i-1], that are
-          greater than current_value, to one position ahead
-          of their current position */
-       while (j >= 0 && arr[j] > currentValue)
-       {
-           arr[j+1] = arr[j];
-           j--;
-       }
-       arr[j+1] = currentValue;
-    }
-
-    return arr;
+/*Insertion sort implementation in JavaScript */
+function insertionSort(arr) {
+	var len = arr.length;
+
+	for (var i = 1; i < len; i++) {
+		currentValue = arr[i];
+		j = i - 1;
+
+		/* Move elements of arr[0..i-1], that are
+		   greater than current_value, to one position ahead
+		   of their current position */
+		while (j >= 0 && arr[j] > currentValue) {
+			arr[j + 1] = arr[j];
+			j--;
+		}
+		arr[j + 1] = currentValue;
+	}
+
+	return arr;
 }
 
 /******************* Testing Selection sort algorithm *********************/
@@ -27,13 +26,13 @@ function insertionSort(arr){
  * Using Math.round() will give you a non-uniform distribution!
  */
 function getRandomInt(min, max) {
-    return Math.floor(Math.random() * (max - min + 1)) + min;
+	return Math.floor(Math.random() * (max - min + 1)) + min;
 }
 
 var arr = [];
 
-for(var i=0;i<10;i++){ //initialize a random integer unsorted array
-    arr.push(getRandomInt(1, 100));
+for (var i = 0; i < 10; i++) { //initialize a random integer unsorted array
+	arr.push(getRandomInt(1, 100));
 }
 
 console.log("Unsorted array: ");