User Profile
Collapse
-
I forgot to say that T(0) = T(1) = 1... -
Complexity Problem
I have an algorithm wich I'm trying my best to find it's complexity but I realy have a problem with recursions. I have two versions.
I've come down to this:
Version1: T(n) = 2n * Sum(1<i<n)[ T(i) + T(n-i) ]
Version2: T(n) = n * Sum(1<i<n)[ T(i) + T(n-i) ]
I wanna know the complexity in the form of O(something), can anyone enlight me on this?
No activity results to display
Show More
Leave a comment: