Bubble sort code reformatted

Author: me-shaon

README.md

@@ -1,4 +1,4 @@
-# Learn Data Structure and Algorithms by Javascript
+# Learn Data Structure and Algorithms by JavaScript
 
 > You need to have basic understanding of the JavaScript programming language to proceed with the codes from this repository.
 

Sorting/Bubble Sort/bubble-sort.js

@@ -1,46 +1,48 @@
+/* Bubble Sort implementation in JavaScript */
+
 //Simple Bubble Sort implementation
-function bubbleSort(arr){
-    var len = arr.length;
-
-    for(var i=0; i<len-1; i++){
-        // Last i elements are already in place, so the inner loops will run until it reaches the last i elements
-        for(var j=0; j<len-i-1;j++){
-            //To Sort in decreasing order, change the comparison operator to '<'
-            if(arr[j] > arr[j+1]){
-                var tmp = arr[j];
-                arr[j] = arr[j+1];
-                arr[j+1] = tmp;
-            }
-        }
-    }
-
-    return arr;
+function bubbleSort(arr) {
+	var len = arr.length;
+
+	for (var i = 0; i < len - 1; i++) {
+		// Last i elements are already in place, so the inner loops will run until it reaches the last i elements
+		for (var j = 0; j < len - i - 1; j++) {
+			//To Sort in decreasing order, change the comparison operator to '<'
+			if (arr[j] > arr[j + 1]) {
+				var tmp = arr[j];
+				arr[j] = arr[j + 1];
+				arr[j + 1] = tmp;
+			}
+		}
+	}
+
+	return arr;
 }
 
 //Following is a slightly modified bubble sort implementation, which tracks the list with a flag to check if it is already sorted
-function modifiedBubbleSort(arr){
-    var len = arr.length;
+function modifiedBubbleSort(arr) {
+	var len = arr.length;
 
-    for(var i=0; i<len-1; i++){
-        var flag = false; //Taking a flag variable
+	for (var i = 0; i < len - 1; i++) {
+		var flag = false; //Taking a flag variable
 
-        // Last i elements are already in place, so the inner loops will run until it reaches the last i elements
-        for(var j=0; j<len-i-1;j++){
-            //To Sort in decreasing order, change the comparison operator to '<'
-            if(arr[j] > arr[j+1]){
-                var tmp = arr[j];
-                arr[j] = arr[j+1];
-                arr[j+1] = tmp;
+		// Last i elements are already in place, so the inner loops will run until it reaches the last i elements
+		for (var j = 0; j < len - i - 1; j++) {
+			//To Sort in decreasing order, change the comparison operator to '<'
+			if (arr[j] > arr[j + 1]) {
+				var tmp = arr[j];
+				arr[j] = arr[j + 1];
+				arr[j + 1] = tmp;
 
-                flag = true; //Setting the flag, if swapping occurs
-            }
-        }
+				flag = true; //Setting the flag, if swapping occurs
+			}
+		}
 
-        //If not swapped, that means the list has already sorted
-        if(!flag) break;
-    }
+		//If not swapped, that means the list has already sorted
+		if (!flag) break;
+	}
 
-    return arr;
+	return arr;
 }
 
 
@@ -51,13 +53,13 @@ function modifiedBubbleSort(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: ");