|
Divide and conquer algorithm - Wikipedia, the free encyclopedia (936 words) |
 | Divide and conquer is a powerful tool for solving conceptually difficult problems, such as the classic Tower of Hanoi puzzle: all it requires is a way of breaking the problem into sub-problems, of solving the trivial cases and of combining sub-problems to the original problem. |
| Dividing the problem into sub-problems so that the sub-problems can be combined again is often the major difficulty in designing a new algorithm. |
| Divide and conquer algorithms are naturally adapted for execution in multi-processor machines, especially shared-memory systems where the communication of data between processors does not need to be planned in advance, because distinct sub-problems can be executed on different processors. |
Feeds |
Contact