vaidehijoshi · July 13, 2017 14:57
diff --git a/heap_sort.js b/heap_sort.js
 function heapSort(array) {
  // Build our max heap.
  buildMaxHeap(array);

  // Find last element.
  lastElement = array.length - 1;

  // Continue heap sorting until we have
  // just one element left in the array.
  while(lastElement > 0) {
    swap(array, 0, lastElement);

    heapify(array, 0, lastElement);

    lastElement -= 1
  }
 }
	function heapSort(array) {
	// Build our max heap.
	buildMaxHeap(array);

	// Find last element.
	lastElement = array.length - 1;

	// Continue heap sorting until we have
	// just one element left in the array.
	while(lastElement > 0) {
	swap(array, 0, lastElement);

	heapify(array, 0, lastElement);

	lastElement -= 1
	}
	}