Add use strict

mgechev · mgechev · commit c27a8458cd83 · 2014-03-08T16:27:04.000+02:00
diff --git a/src/sorting/linearsort/bucketsort.js b/src/sorting/linearsort/bucketsort.js
@@ -1,104 +1,112 @@
-/**
- * Bucketsort. This algorithm has complexity O(n) but it's not
- * correct for every input.
- *
- * @public
- */
-var bucketSort = (function () {
+(function (exports) {
+
+  'use strict';
 
   /**
-   * Insertionsort.
+   * Bucketsort. This algorithm has complexity O(n) but it's not
+   * correct for every input.
    *
-   * @private
-   * @param {array} array Input array
-   * @returns {array} array Sorted input array
+   * @public
    */
-  function insertionSort(array) {
-    var current,
-        j;
-    for (var i = 1; i < array.length; i += 1) {
-      current = array[i];
-      j = i - 1;
-      while (j >= 0 && current < array[j]) {
-        array[j + 1] = array[j];
-        j -= 1;
+  var bucketSort = (function () {
+
+    /**
+     * Insertionsort.
+     *
+     * @private
+     * @param {array} array Input array
+     * @returns {array} array Sorted input array
+     */
+    function insertionSort(array) {
+      var current,
+          j;
+      for (var i = 1; i < array.length; i += 1) {
+        current = array[i];
+        j = i - 1;
+        while (j >= 0 && current < array[j]) {
+          array[j + 1] = array[j];
+          j -= 1;
+        }
+        array[j + 1] = current;
       }
-      array[j + 1] = current;
+      return array;
     }
-    return array;
-  }
 
-  /**
-   * Creates buckets for given array
-   *
-   * @private
-   * @param {array} array Input array
-   * @returns {array} buckets Array whith array for each bucket.
-   *  Each bucket contains an array with all elements from the input which are with suitable size.
-   */
-  function createBuckets(array) {
-    var buckets = [],
-        currentBucket,
-        current,
-        sectorSize = 1 / array.length;
-    for (var i = 0; i < array.length; i += 1) {
-      current = array[i];
-      currentBucket = Math.floor(current / sectorSize);
-      if (buckets[currentBucket] === undefined) {
-        buckets[currentBucket] = [];
+    /**
+     * Creates buckets for given array
+     *
+     * @private
+     * @param {array} array Input array
+     * @returns {array} buckets Array whith array for each bucket.
+     *  Each bucket contains an array with all elements from the input which are with suitable size.
+     */
+    function createBuckets(array) {
+      var buckets = [],
+          currentBucket,
+          current,
+          sectorSize = 1 / array.length;
+      for (var i = 0; i < array.length; i += 1) {
+        current = array[i];
+        currentBucket = Math.floor(current / sectorSize);
+        if (buckets[currentBucket] === undefined) {
+          buckets[currentBucket] = [];
+        }
+        buckets[currentBucket].push(current);
       }
-      buckets[currentBucket].push(current);
+      return buckets;
     }
-    return buckets;
-  }
 
-  /**
-   * Sorts the arrays from each bucket.
-   *
-   * @private
-   * @param {array} buckets Given buckets
-   * @returns {array} buckets Buckets with sorted arrays for each bucket
-   */
-  function sortBuckets(buckets) {
-    for (var i = 0; i < buckets.length; i += 1) {
-      if (buckets[i] !== undefined) {
-        insertionSort(buckets[i]);
+    /**
+     * Sorts the arrays from each bucket.
+     *
+     * @private
+     * @param {array} buckets Given buckets
+     * @returns {array} buckets Buckets with sorted arrays for each bucket
+     */
+    function sortBuckets(buckets) {
+      for (var i = 0; i < buckets.length; i += 1) {
+        if (buckets[i] !== undefined) {
+          insertionSort(buckets[i]);
+        }
       }
+      return buckets;
     }
-    return buckets;
-  }
 
-  /**
-   * Unions all buckets' arrays
-   *
-   * @private
-   * @param {array} buckets Input buckets
-   * @returns {array} result Sorted array which contains all elements form each bucket
-   */
-  function unionBuckets(buckets) {
-    var result = [],
-        currentBucket;
-    for (var i = 0; i < buckets.length; i += 1) {
-      currentBucket = buckets[i];
-      if (currentBucket !== undefined) {
-        for (var j = 0; j < currentBucket.length; j += 1) {
-          result.push(currentBucket[j]);
+    /**
+     * Unions all buckets' arrays
+     *
+     * @private
+     * @param {array} buckets Input buckets
+     * @returns {array} result Sorted array which contains all elements form each bucket
+     */
+    function unionBuckets(buckets) {
+      var result = [],
+          currentBucket;
+      for (var i = 0; i < buckets.length; i += 1) {
+        currentBucket = buckets[i];
+        if (currentBucket !== undefined) {
+          for (var j = 0; j < currentBucket.length; j += 1) {
+            result.push(currentBucket[j]);
+          }
         }
       }
+      return result;
     }
-    return result;
-  }
 
-  /**
-   * Sorts given array with bucketsort
-   *
-   * @public
-   * @param {array} array Input array which should be sorted
-   * @returns {array} Sorted array
-   */
-  return function (array) {
-    var buckets = createBuckets(array);
-    sortBuckets(buckets);
-    return unionBuckets(buckets);
-  };
-}());
+    /**
+     * Sorts given array with bucketsort
+     *
+     * @public
+     * @param {array} array Input array which should be sorted
+     * @returns {array} Sorted array
+     */
+    return function (array) {
+      var buckets = createBuckets(array);
+      sortBuckets(buckets);
+      return unionBuckets(buckets);
+    };
+  }());
+
+  exports.bucketSort = bucketSort;
+
+}(typeof exports === 'undefined' ? window : exports));
