mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

added implementation for heap sort algorithm

Browse Source
This commit is contained in:
arijit pande 2016-08-14 09:51:52 +00:00
parent 8d5be8a436
commit 04d15692a8
1 changed files with 35 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
sorts/heap_sort.py Normal file
View File

@ -0,0 +1,35 @@
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)
def heap_sort(unsorted):
n=len(unsorted)
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:
input_function = raw_input
else:
input_function = input
user_input = input_function('Enter numbers separated by coma:\n')
unsorted = [int(item) for item in user_input.split(',')]
print heap_sort(unsorted)