w3resource

Python: Create a heapsort, pushing all values onto a heap and then popping off the smallest values one at a time

Python heap queue algorithm: Exercise-24 with Solution

Write a Python program to create a heapsort, pushing all values onto a heap and then popping off the smallest values one at a time.

Sample Solution:

Python Code:

import heapq
def heapsort(h):
    heap = []
    for value in h:
        heapq.heappush(heap, value)
    return [heapq.heappop(heap) for i in range(len(heap))]

print(heapsort([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100]))

Sample Output:

[10, 20, 20, 40, 50, 50, 60, 70, 80, 90, 100]

Flowchart:

Python heap queue algorithm: Create a heapsort, pushing all values onto a heap and then popping off the smallest values one at a time.

Visualize Python code execution:

The following tool visualize what the computer is doing step-by-step as it executes the said program:


Python Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: Write a Python program to push an item on the heap, then pop and return the smallest item from the heap.
Next: Write a Python program to get the two largest and three smallest items from a dataset.

What is the difficulty level of this exercise?

Test your Python skills with w3resource's quiz

Python: Tips of the Day

Creates a dictionary with the same keys as the provided dictionary and values generated by running the provided function for each value:

Example:

def tips_map_values(obj, fn):
  ret = {}
  for key in obj.keys():
    ret[key] = fn(obj[key])
  return ret
users = {
  'Owen': { 'user': 'Owen', 'age': 29 },
  'Eddie': { 'user': 'Eddie', 'age': 15 }
}

print(tips_map_values(users, lambda u : u['age'])) # {'Owen': 29, 'Eddie': 15}

Output:

{'Owen': 29, 'Eddie': 15}