Running Time of Recursive calls

Please support our Computer Science advertiser: Learn about neural networks and artificial intelligence.
Reply

Join Date: Jan 2006
Posts: 1
Reputation: mauve_mon is an unknown quantity at this point 
Solved Threads: 0
mauve_mon mauve_mon is offline Offline
Newbie Poster

Running Time of Recursive calls

 
0
  #1
Jan 29th, 2006
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!!
Reply With Quote Quick reply to this message  
Join Date: Jan 2006
Posts: 6
Reputation: Rashakil is an unknown quantity at this point 
Solved Threads: 0
Rashakil Rashakil is offline Offline
Banned

Re: Running Time of Recursive calls

 
1
  #2
Jan 29th, 2006
Reply With Quote Quick reply to this message  
Reply

This thread is more than three months old.
Perhaps start a new thread instead?
Message:



Similar Threads
Other Threads in the Computer Science Forum
Thread Tools Search this Thread



About Us | Contact Us | Advertise | DaniWeb | Acceptable Use Policy | RSS Feed

©2003 - 2009 DaniWeb® LLC