Running Time of Recursive calls

Hello!!

Could anyone please tell me how to formulate the basic running time T(n) equation in an algo with involves recursive calls.

For example for merge sort we have:

T(n)=2T(n/2)+D+C(n)

What do we exactly need to note to form such an eqn?!?

Thanks!!

Newbie Poster

1 post since Jan 2006

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Banned

9 posts since Jan 2006

Reputation Points: 51

Solved Threads: 0

This article has been dead for over three months

You