I cannot estimate the time complexity of this code? This code is for optimal binary search tree dp problem.
Is it O(n3) or O(n4) or O(n2)
Someone please help.
Also if someone could tell me some tutorial on how to find time complexity of recursion.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
Can someone tell the time complexity of this code?
I cannot estimate the time complexity of this code? This code is for optimal binary search tree dp problem.
Is it O(n3) or O(n4) or O(n2)
Someone please help.
Also if someone could tell me some tutorial on how to find time complexity of recursion.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 |
![]() |
aman_naughty | 2019-07-27 20:10:17 | 345 | Initial revision (published) |
Название |
---|