Question

Write the recurrence relation for divide and conquer and explain

Answer 1

Answer:

n comparisons are required to find the original solution from those sub- problems. There is a theorem that gives asymptotic behavior of any sequence defined by a divide-and-conquer recurrence with f(n)=c.nd for constants c>0 and d≥0. This theorem is sometimes called the master theorem.