Example: barber
Divide-and-conquer algorithms - EECS at UC Berkeley

Divide-and-conquer algorithms - EECS at UC Berkeley

Back to document page

Divide-and-conquer algorithms The divide-and-conquer strategy solves a problem by: 1. Breaking it into subproblems that are themselves smaller instances of the same type of problem 2. Recursively solving these subproblems 3. Appropriately combining their answers The real work is done piecemeal, in three different places: in the partitioning of ...

  Conquer, Divide, Divide and conquer

Download Divide-and-conquer algorithms - EECS at UC Berkeley


Information

Domain:

Source:

Link to this page:

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

Other abuse

Advertisement

Related search queries