Timeline for Merging Sorted lists using Heap Data Structure
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 11, 2015 at 3:05 | vote | accept | Atinesh | ||
| Feb 6, 2015 at 8:12 | history | edited | Raphael | CC BY-SA 3.0 |
edited tags
|
| Feb 6, 2015 at 5:34 | history | edited | hengxin |
adding tags
|
|
| Feb 5, 2015 at 23:58 | answer | added | Yuval Filmus | timeline score: 5 | |
| Feb 5, 2015 at 22:14 | comment | added | Pseudonym♦ | A heap data structure can be used for heap sort, but it is actually a priority queue. You insert elements into the heap, and then you can extract them in order of "priority". For example, a max-heap would return the largest element first and a min-heap would return the smallest element first. As an additional hint, you're given a bunch of already-sorted lists. What sort algorithm would you consider first? | |
| Feb 5, 2015 at 22:06 | history | asked | Atinesh | CC BY-SA 3.0 |