File heap_sort.py

heap_sort.py:None–None

# This program is a comparison based sorting technique.
# It is similar to selection sort in the sense that it first identifies the maximum element,
# and places it at the end. We repeat the process until the list is sorted.
# The sort algorithm has a time complexity of O(nlogn)