I am wondering which is the most efficient way (minimal time complexity) to implement a heap (say heap-min). Heap mentioned here means a data structure letting us perform insertion, deletion and retrieving the minimum value on a collection of data.
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
I am wondering which is the most efficient way (minimal time complexity) to implement a heap (say heap-min). Heap mentioned here means a data structure letting us perform insertion, deletion and retrieving the minimum value on a collection of data.
Name |
---|
Binary heap stored as an array. Every other choice is slower and harder to write (only for these operations).
https://en.wikipedia.org/wiki/Heap_(data_structure)#Comparison_of_theoretic_bounds_for_variants