Member Avatar for mauve_mon

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

  • 2 Contributors
  • 1 Reply
  • 81 Views
  • 6 Hours Discussion Span
  • Latest Post Latest Post by Rashakil
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.