mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-19 00:37:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

fixed heap_sort

Browse Source
This commit is contained in:
Harshil Darji 2016-08-17 17:18:11 +05:30
parent f18d6dd92a
commit ca78a8a9af
1 changed files with 27 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
sorts/heap_sort.py
View File

@ -1,4 +1,4 @@
"""
'''
This is a pure python implementation of the heap sort algorithm.
For doctests run following command:
@ -8,9 +8,9 @@ python3 -m doctest -v heap_sort.py
For manual testing run:
python insertion_sort.py
"""
from __future__ import print_function
'''
from __future__ import print_function
def heapify(unsorted, index, heap_size):
largest = index
@ -27,7 +27,8 @@ def heapify(unsorted,index,heap_size):
heapify(unsorted, largest, heap_size)
def heap_sort(unsorted):
"""Pure implementation of the heap sort algorithm in Python
'''
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
@ -41,16 +42,15 @@ def heap_sort(unsorted):
>>> heap_sort([-2, -5, -45])
[-45, -5, -2]
"""
'''
n = len(unsorted)
for i in range (n/2 - 1 , -1, -1):
for i in range(n//2 - 1, -1, -1):
heapify(unsorted, i, n)
for i in range(n - 1, -1, -1):
unsorted[0], unsorted[i] = unsorted[i], unsorted[0]
heapify(unsorted, 0, i)
return unsorted
if __name__ == '__main__':
import sys
if sys.version_info.major < 3: