Python/sorts/heap_sort.py

59 lines
1.5 KiB
Python
Raw Normal View History

2019-10-05 05:14:13 +00:00
"""
This is a pure Python implementation of the heap sort algorithm.
2016-08-14 10:04:21 +00:00
For doctests run following command:
2016-08-16 16:56:38 +00:00
python -m doctest -v heap_sort.py
or
2016-08-16 16:56:38 +00:00
python3 -m doctest -v heap_sort.py
For manual testing run:
2016-09-02 10:59:46 +00:00
python heap_sort.py
2019-10-05 05:14:13 +00:00
"""
2016-08-17 11:48:11 +00:00
def heapify(unsorted, index, heap_size):
largest = index
left_index = 2 * index + 1
right_index = 2 * index + 2
if left_index < heap_size and unsorted[left_index] > unsorted[largest]:
largest = left_index
if right_index < heap_size and unsorted[right_index] > unsorted[largest]:
largest = right_index
if largest != index:
unsorted[largest], unsorted[index] = unsorted[index], unsorted[largest]
heapify(unsorted, largest, heap_size)
2016-09-25 21:15:14 +00:00
2016-08-17 11:48:11 +00:00
def heap_sort(unsorted):
2019-10-05 05:14:13 +00:00
"""
2016-08-17 11:48:11 +00:00
Pure implementation of the heap sort algorithm in Python
:param collection: some mutable ordered collection with heterogeneous
comparable items inside
:return: the same collection ordered by ascending
Examples:
>>> heap_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> heap_sort([])
[]
>>> heap_sort([-2, -5, -45])
[-45, -5, -2]
2019-10-05 05:14:13 +00:00
"""
2016-08-17 11:48:11 +00:00
n = len(unsorted)
2016-09-25 21:15:14 +00:00
for i in range(n // 2 - 1, -1, -1):
2016-08-17 11:48:11 +00:00
heapify(unsorted, i, n)
2016-09-02 10:59:46 +00:00
for i in range(n - 1, 0, -1):
2016-08-17 11:48:11 +00:00
unsorted[0], unsorted[i] = unsorted[i], unsorted[0]
heapify(unsorted, 0, i)
2016-08-16 20:03:02 +00:00
return unsorted
2019-10-05 05:14:13 +00:00
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
2016-08-17 11:48:11 +00:00
print(heap_sort(unsorted))