The structure of divide and conquer algorithms
By: Douglas R. Smith
Contributors: Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1983
Place of publication: Monterey, Calif
Language: eng
Number of pages: 38
Subjects: Computer programming; Algorithms; Automation
Other titles: NPS-52-83-002.
Description: 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)
Notes: "NPS-52-83-002."

"March 1983."

Cover title.

"Prepared for: Chief of Naval Research; Arlington, VA 22217."

Includes bibliographic references (p. 36-37).

"Approved for public release; distribution is unlimited."

Technical report; 1983.