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 | jiangly | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | -is-this-fft- | 162 |
3 | Um_nik | 161 |
4 | atcoder_official | 160 |
5 | djm03178 | 157 |
5 | Dominater069 | 157 |
7 | adamant | 154 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 148 |
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