Updated Heapsort.js src code and test code -

Author: AJK24

src/sorting/heapsort.js

@@ -18,7 +18,7 @@
      * @param {function} cmp Comparison function.
      */
     function heapify(array, index, heapSize, cmp) {
-console.log("heapifying"); 
+//console.log("heapifying"); 
 
       var left = 2 * index + 1;
       var right = 2 * index + 2;
@@ -39,7 +39,7 @@ console.log("heapifying");
         heapify(array, largest, heapSize, cmp);
       }
 
-console.log(array);
+//console.log(array);
 
 
     }
@@ -55,6 +55,7 @@ console.log(array);
     function buildMaxHeap(array, cmp) {
       for (var i = Math.floor(array.length / 2); i >= 0; i -= 1) {
         heapify(array, i, array.length, cmp);
+console.log(array);
       }
 
       return array;
@@ -91,7 +92,7 @@ console.log(array);
         size -= 1;
         heapify(array, 0, size, cmp);
       }
-console.log(array);
+//console.log(array);
       return array;
     };
   }());

test/sorting/heapsort.spec.js

@@ -1,17 +1,17 @@
 
 var arr = [];
-var MAX = 100;
+var MAX = 15;
 
 var sort = require('./../../src/sorting/heapsort.js').heapSort;
 //console.log(sort([2, 5, 1, 0, 4])); // [ 0, 1, 2, 4, 5 ]
 
 
-//for(var i = 0; i < MAX; ++i){
-  //    arr[i] = Math.floor((Math.random() * 100) + 1);
-    //  print(arr[i]);
-//}
+for(var i = 0; i < MAX; ++i){
+    arr[i] = Math.floor((Math.random() * 50) + 1);
+   // print(arr[i]);
+}
 
-var array = [40,7,41,13,19,92,51,31];
+//var array = [40,7,41,13,19,92,51,31];
 
 
 function dispArr(arr) {
@@ -31,10 +31,16 @@ function dispArr(arr) {
 
 
 
+
+
 //console.log(arr);
-dispArr(array);
-sort(array);	//added print statements to it for testing
+dispArr(arr);
+sort(arr, (function(a,b){
+	return b - a;
+}));
+
+//added print statements to it for testing
 console.log("");
 //console.log(arr);
-dispArr(array);
+dispArr(arr);