algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 01:09:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

PEP style and tree traversals

Browse Source
This commit is contained in:
Akshay Sharma
2016-09-26 02:45:14 +05:30
parent 0c409f37e9
commit 9deae5d14c
7 changed files with 115 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
sorts/heap_sort.py
View File

@ -12,6 +12,7 @@ python heap_sort.py
from __future__ import print_function
def heapify(unsorted, index, heap_size):
largest = index
left_index = 2 * index + 1
@ -26,6 +27,7 @@ def heapify(unsorted, index, heap_size):
unsorted[largest], unsorted[index] = unsorted[index], unsorted[largest]
heapify(unsorted, largest, heap_size)
def heap_sort(unsorted):
'''
Pure implementation of the heap sort algorithm in Python
@ -44,7 +46,7 @@ def heap_sort(unsorted):
[-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, 0, -1):
unsorted[0], unsorted[i] = unsorted[i], unsorted[0]