Selection sort code comment and doc updated

Author: me-shaon

Sorting/Selection Sort/README.md

@@ -9,12 +9,12 @@ Selection sort algorithm starts by compairing first two elements of an array and
 
 If there are n elements to be sorted then, the process mentioned above should be repeated n-1 times to get required result.
 
-#####A visualization on Selection Sort
+#### A visualization on Selection Sort
 ![Selection sort demonstration](https://upload.wikimedia.org/wikipedia/commons/9/94/Selection-Sort-Animation.gif)
 
 *Selection sort animation. Red is current min. Yellow is sorted list. Blue is current item.*
 
-####Complexity Analysis
+#### Complexity Analysis
 - Worst Case - O(n<sup>2</sup>)
 - Average Case - O(n<sup>2</sup>)
 - Best Case - O(n<sup>2</sup>)

Sorting/Selection Sort/selection-sort.js

@@ -1,31 +1,30 @@
-//Simple Selection Sort implementation
-function selectionSort(arr){
-    var len = arr.length;
-
-    /* advance the position through the entire array */
-    /*   (could do i < n-1 because single element is also min element) */
-    for(var i=0; i<len-1; i++){
-        // find the min element in the unsorted a[i .. n-1]
-
-        var currentMin = i; // assume the min is the first element
-        // test against elements after i to find the smallest
-        for (var j=i+1; j<len; j++)
-        {
-            // if this element is less, then it is the new minimum
-            if (arr[j] < arr[currentMin]) //To sort in decreasing order just change the comparison operator to '>'
-                currentMin = j; // found new minimum; remember its index
-        }
-
-        if(currentMin != i) //if the current_Min is equal to i, then it is in right position already
-        {
-            //Swap the values
-            tmp = arr[i];
-            arr[i] = arr[currentMin];
-            arr[currentMin] = tmp;
-        }
-    }
-
-    return arr;
+/* Selection Sort implementation in JavaScript */
+function selectionSort(arr) {
+	var len = arr.length;
+
+	/* advance the position through the entire array */
+	/*   (could do i < n-1 because single element is also min element) */
+	for (var i = 0; i < len - 1; i++) {
+		// find the min element in the unsorted a[i .. n-1]
+
+		var currentMin = i; // assume the min is the first element
+		// test against elements after i to find the smallest
+		for (var j = i + 1; j < len; j++) {
+			// if this element is less, then it is the new minimum
+			if (arr[j] < arr[currentMin]) //To sort in decreasing order just change the comparison operator to '>'
+				currentMin = j; // found new minimum; remember its index
+		}
+
+		if (currentMin != i) //if the current_Min is equal to i, then it is in right position already
+		{
+			//Swap the values
+			tmp = arr[i];
+			arr[i] = arr[currentMin];
+			arr[currentMin] = tmp;
+		}
+	}
+
+	return arr;
 }
 
 /******************* Testing Selection sort algorithm *********************/
@@ -35,13 +34,13 @@ function selectionSort(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: ");