Example: barber
Divide-and-conquer algorithms

Divide-and-conquer algorithms

Back to document page

S.Dasgupta,C.H.Papadimitriou,andU.V.Vazirani 59 Figure 2.3 Each problem of size nis divided into asubproblems of size n=b. Size 1 Size n=b2 Size n=b Size n Depth logb n Width alogb n = nlogb a Branching factor a then T(n) = 8 <: O(nd) ifd>log b a O(nd logn) ifd= log b a O(nlogb a) ifd<log b a. This single theorem tells us the running times of most of the divide-and-conquer

  Conquer, Divide, Divide and conquer

Download Divide-and-conquer algorithms


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries