Python Heap Sort

#! /Usr/bin/ENV pythonfrom heapq import heappush, heappopif _ name _ = "_ main _": # simple sanity test heap = [] DATA = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0] For item in data: heappush (heap, item) Sort = [] While heap: sort. append (heappop (HEAP) print sort

A heap must satisfy Paren <leaf, and the root is the smallest

Heappush

1. append the new value at the end of the array

2. Place the end node in the appropriate position, which is obtained by comparing it with the parent node in heap.

Heappop

1. Put the root (minimum) Pop

2. Insert the value of the End Node to the position of the first root node.

3. Adjust the location of the root node by comparing it with the child node in heap.