divide and conquer technic is one of the technic to design and analysis of algorithm.

1. Divide and conquer
Bharati C

2. Introduction
• Divided into smaller sub problems.
• These sub problems are solved independently.
• Combining all the solutions of sub problems into a
solution of the whole.
• If sub problems are large enough then reapplied
divide and conquer.

3. Algorithm divcon(p)
{
if p is too small then
return solution p
else
{
Divide(p) and obtain p1,p2...pn
Where n>=1
Apply divcon to each subproblem
return combine
divcon(p1),divcon(p2),.......divcon(pn)
}
}