Heaps: the most urgent parcel firstLesson 7 of 11
Heapsort: the backlog in place
Yesterday's eight parcels: build in 5 swaps, 21 in total. A min-heap sorts in place, descending, in O(n log n).
Locked
Unlock the rest of Algorithms and Data Structures: what everything costs.
- Every lesson, every resource, unlocked instantly.
- Track progress and pick up where you left off.
- Free preview lessons stay readable from the outline.