﻿ Python heap queue algorithm: Create a heapsort, pushing all values onto a heap and then popping off the smallest values one at a time - 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 Code Editor:

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

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

﻿