Can someone tell the time complexity of this code?

Revision en1, by 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.

Tags #running time, time complexity, #dp, tree

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English aman_naughty 2019-07-27 20:10:17 345 Initial revision (published)