Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Dynamic Programming
What is the complexity of the algorithm for obtaining the minimum cost binary search tree with n - identifiers ?
1
O(\({n^2}^{}\)log n)
2
O(\({2^n}^{}\))
3
O(\({n^3}^{}\))
4
O(\({n^3}^{}\)log n)