Merge pull request #54 from gauravmittal1995/master

Improving efficiency of bubblesort.

Author: felipernb

algorithms/sorting/bubble_sort.js

@@ -26,9 +26,10 @@ var Comparator = require('../../util/comparator');
  * Bubble sort algorithm O(n^2)
  */
 var bubbleSort = function (a, comparatorFn) {
-  var comparator = new Comparator(comparatorFn),
-    n = a.length,
-    bound = n - 1;
+  var comparator = new Comparator(comparatorFn);
+  var n = a.length;
+  var bound = n - 1;
+  var check = 0;
   for (var i = 0; i < n - 1; i++) {
     var newbound = 0;
     for (var j = 0; j < bound; j++) {
@@ -37,11 +38,13 @@ var bubbleSort = function (a, comparatorFn) {
         a[j] = a[j + 1];
         a[j + 1] = tmp;
         newbound = j;
+        check = 1;
       }
     }
+    if (0 === check)
+      return a;
     bound = newbound;
   }
-
   return a;
 };