heap sort

gistfile1.rb

require_relative "heap"

class Array
  def heap_sort!
    # Create a heap
    heap = BinaryMinHeap.new

    # make an array to keep the sorted elements
    sorted = []


    # push all the array's elements into the heap
    self.each do |e|
      heap.push(e)
    end

    # take out the smallest element out of the heap
    smallest = heap.extract

    # while we have elements in the heap, push the smallest into the sorted array
    while smallest 
      sorted.push(smallest)
      smallest = heap.extract
    end

    # Now the sorted array has all the elements sorted but the self array does not...
    # copy each of the elements in the sorted array to the self array

    sorted.each_with_index do |element, idx|
      self[idx] = element
    end

  end
end