The Structure of Divide and Conquer Algorithms.
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
The structure of divide and conquer algorithms is represented by program schemes which provide a kind of normal-form for expressing these algorithms. A theorem relating the correctness of a divide and conquer algorithm to the correctness of its subalgorithms is given. Several strategies for designing divide and conquer algorithms for sorting a list of numbers, evaluating a propositional formula, and forming the cartesian product of two sets. Author
- Theoretical Mathematics