Complexity Problem

desaurido

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?

desaurido

Quote:

Originally Posted by desaurido

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?

I forgot to say that T(0) = T(1) = 1

JosAH

What is T(2)? It isn't defined by your recurrence relations (1 < i < n)

kind regards,

Jos

shabinesh

Can you give insight of your algorithm. and might be helpful for better understanding.

Complexity Problem

re: Complexity Problem

re: Complexity Problem

re: Complexity Problem

Similar Algorithms / Advanced Math bytes

/bytes/development

/bytes/it

/bytes/about