Fix the indentation of counting sort

mgechev · mgechev · commit fb637ca333d2 · 2014-03-08T16:30:48.000+02:00
diff --git a/src/sorting/linearsort/bucketsort.js b/src/sorting/linearsort/bucketsort.js
@@ -4,7 +4,7 @@
 
   /**
    * Bucketsort. This algorithm has complexity O(n) but it's not
-   * correct for every input.
+   * correct for each input.
    *
    * @public
    */
diff --git a/src/sorting/linearsort/countingsort.js b/src/sorting/linearsort/countingsort.js
@@ -1,5 +1,3 @@
-var array = [44,2,34,6,7,34,4,4,2,3,6,8];
-
 /**
  * Counting sort algorithm. It's with complexity O(n) but it's
  * correct for specific input.
@@ -8,81 +6,79 @@ var array = [44,2,34,6,7,34,4,4,2,3,6,8];
  */
 var countingSort = function () {
 
-    /**
-     * Gets the count of the elements into the input array
-     *
-     * @private
-     * @param {array} array The input array
-     * @returns {array} count The count of each element from the input array
-     */
-    function getCount(array) {
-        var count = [],
-            current;
-        for (var i = 0; i < array.length; i += 1) {
-            current = array[i];
-            if (count[current] !== undefined) {
-                count[current] += 1;
-            } else {
-                count[current] = 1;
-            }
-        }
-        return count;
+  /**
+   * Gets the count of the elements into the input array
+   *
+   * @private
+   * @param {array} array The input array
+   * @returns {array} count The count of each element from the input array
+   */
+  function getCount(array) {
+    var count = [],
+        current;
+    for (var i = 0; i < array.length; i += 1) {
+      current = array[i];
+      if (count[current] !== undefined) {
+        count[current] += 1;
+      } else {
+        count[current] = 1;
+      }
     }
+    return count;
+  }
 
-    /**
-     * Gets the count of the elements which are less than a given
-     *
-     * @private
-     * @param {array} array The input array
-     * @returns {array} less The count of the elements which are less than each element from the input
-     */
-    function getLessCount(array) {
-        var less = [],
-            last;
-        less[0] = array[0] || 0;
-        for (var i = 1; i < array.length; i += 1) {
-            last = array[i - 1] || 0;
-            less[i] = last + less[i - 1];
-        }
-        return less;
+  /**
+   * Gets the count of the elements which are less than a given
+   *
+   * @private
+   * @param {array} array The input array
+   * @returns {array} less The count of the elements which are less than each element from the input
+   */
+  function getLessCount(array) {
+    var less = [],
+        last;
+    less[0] = array[0] || 0;
+    for (var i = 1; i < array.length; i += 1) {
+      last = array[i - 1] || 0;
+      less[i] = last + less[i - 1];
     }
+    return less;
+  }
 
-    /**
-     * Sorts the input array
-     *
-     * @private
-     * @param {array} array Input which should be sorted
-     * @param {array} less Count of the less elements for each element
-     * @returns {array} result The sorted input
-     */
-    function sort(array, less) {
-        var result = [],
-            currentPositions = [],
-            current,
-            position;
-        for (var i = 0; i < array.length; i += 1) {
-            current = array[i];
-            position = less[current];
-            if (currentPositions[current] === undefined) {
-                currentPositions[current] = position;
-            }
-            result[currentPositions[current]] = current;
-            currentPositions[current] += 1;
-        }
-        return result;
+  /**
+   * Sorts the input array
+   *
+   * @private
+   * @param {array} array Input which should be sorted
+   * @param {array} less Count of the less elements for each element
+   * @returns {array} result The sorted input
+   */
+  function sort(array, less) {
+    var result = [],
+        currentPositions = [],
+        current,
+        position;
+    for (var i = 0; i < array.length; i += 1) {
+      current = array[i];
+      position = less[current];
+      if (currentPositions[current] === undefined) {
+        currentPositions[current] = position;
+      }
+      result[currentPositions[current]] = current;
+      currentPositions[current] += 1;
     }
+    return result;
+  }
 
-    /**
-     * Sorts a given array
-     *
-     * @public
-     * @param {array} array Array which should be sorted
-     * @returns {array} array Sorted array
-     */
-    return function (array) {
-        var less = getLessCount(getCount(array));
-        return sort(array, less);
-    };
-}();
-
-console.log(countingSort(array));
+  /**
+   * Sorts a given array
+   *
+   * @public
+   * @param {array} array Array which should be sorted
+   * @returns {array} array Sorted array
+   */
+  return function (array) {
+    var less = getLessCount(getCount(array));
+    return sort(array, less);
+  };
+}();

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`
`5`	`5`	`/**`
`6`	`6`	`* Bucketsort. This algorithm has complexity O(n) but it's not`
`7`		`- * correct for every input.`
	`7`	`+ * correct for each input.`
`8`	`8`	`*`
`9`	`9`	`* @public`
`10`	`10`	`*/`