Repeatedly take the smallest and join the result.
Acceptance criteria
- 1.#out should show 1-3-5.
DSA Tutorial · Heaps and Priority Queues
Practice: Heap Sort and Streaming Data
These 10 tasks go with the Heap Sort and Streaming Data chapter. 5 of them ask you to build something small from scratch; 5 give you code that is already broken and ask you to work out why. Set aside about 90 minutes for the whole set, though you can do them in any order.
Nothing here is marked by a person. When you press Submit, the editor checks your code against the points listed under each task and tells you straight away what passed and what didn't (you need a free account to submit). If you get stuck, there are hints, and a worked solution once you've had a go. The first 2 tasks are free; the rest are part of the practice plan.
If it's been a while since you read the chapter, here is how it starts: “Heap sort is the sorting algorithm nobody uses and everybody should understand — it is the proof that O(n log n) is achievable without the extra memory merge sort needs.” .