Running Time of Recursive calls

Expand Post »

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!!

Similar Threads

Time complexity of algorithm in Computer Science
Order of a recursive function in C
MIPS Recursive Programming, Help please! in Assembly
Question: Linear Time Sorting Problem in Computer Science
recursive function in C

mauve_mon

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

1 posts
since Jan 2006

Permalink

Jan 29th, 2006

Re: Running Time of Recursive calls

http://en.wikipedia.org/wiki/Master_theorem

Rashakil

Reputation Points: 51

Solved Threads: 0

Banned

Offline

6 posts
since Jan 2006

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in Computer Science Forum Timeline: Uml

Next Thread in Computer Science Forum Timeline: Useful information!

DaniWeb Message

Cancel Changes

User Name
Password