Timeline for Find k max integers of an array -- Min Heap vs. Selection Algo vs. Selection Sort
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 24, 2016 at 21:11 | comment | added | Jeremy West | A huge advantage of the min-heap approach is that you only need a single pass through the data. If the data is being read from a file, database, or network stream, rather than stored in memory, this could potentially be a huge factor in performance. Even if it is in memory, the cache performance of a single pass with a small-ish heap could be significant. | |
| Dec 23, 2016 at 0:08 | history | answered | user22815 | CC BY-SA 3.0 |