Scribd
Upload
19 views22 pages

Lecture-5.2-Recurrence Relation

The document discusses the divide and conquer strategy for solving computational problems by dividing problems into smaller pieces, solving each piece recursively, and combining the solutions into an overall solution.

Uploaded by

Zeeshan Wasi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
19 views22 pages

Lecture-5.2-Recurrence Relation

The document discusses the divide and conquer strategy for solving computational problems by dividing problems into smaller pieces, solving each piece recursively, and combining the solutions into an overall solution.

Uploaded by

Zeeshan Wasi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 22

Recurrence Relation

Divide and Conquer Strategy


Divide and Conquer
Divide and Conquer is a Strategy employed to solve a large
number of computational problems:

 Divide: the problem into a small number of pieces

 Conquer: solve each piece by applying divide and conquer to it


recursively

 Combine: the pieces together into a global solution.


CONTROL ABSTRACTION FOR DIVIDE
AND CONQUER ALGORITHM
 Algorithm D and C (P)
{
if small(P)
then
return S(P)
else
{
divide P into smaller instances P1 ,P2 .....Pk
Apply D and C to each sub problem
Return
combine (D and C(P1)+ D and C(P2)+.......+D and C(Pk))
}
}
Recurrence Relation
Recurrence Relation dividing
Function
  T
  T

You might also like