What is the time complexity for building a segment tree for an array of size n?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
What is the time complexity for building a segment tree for an array of size n?
Название |
---|
O(n). Because in each recursuion call you recurse twice for subtasks of size n / 2 and do O(1) operations (that's if you're building segment tree for simple operation like sum or max).
T(n) = 2T(n / 2) + O(1) = O(n) (by Master-theorem)
Another way to see this — segment tree has n nodes on lowest level, n / 2 nodes on second level, n / 4 on third, ..., 1 on top level = 2 * n nodes = O(n) nodes, and in all of them you do O(1) operations.
Also, you can appreciate segtree visualization here. :D
2N memory and operations required. [N; N + N — 1] leaves + [1; N — 1] internal nodes and root.