Can someone tell the time complexity of this code?

Правка en1, от aman_naughty, 2019-07-27 20:10:17

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.

Теги #running time, time complexity, #dp, tree

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский aman_naughty 2019-07-27 20:10:17 345 Initial revision (published)