in Algorithms
407 views
0 votes
0 votes

in questions like how many multiplications of n are needed are being solved by dividing n into n/2 * n/2 and then end up with recurrence t(n) = t(n/2) + O(1)

 

How to reach this type of analysis where we get to know that we have to divide n into halves?

in Algorithms
by
407 views

3 Comments

Experience earns you few things, which can't be learnt instantly!!
1
1

@Manu Thakur Sir, I'm such a huge fan of your answers. The way you write Recursive Equations of each algo!

1
1
thanks iarnav!!
0
0

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
3