<div class="description">
<dl><dd>"NPS-52-83-002."</dd>
<dd>"March 1983."</dd>
<dd>Cover title</dd>
<dd>Includes bibliographic references (p. 36-37)</dd>
<dd>"Prepared for: Chief of Naval Research; Arlington, VA 22217."</dd>
<dd>Technical report; 1983</dd>
<dd>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)</dd></dl><br>Subjects: Computer programming; Algorithms</div>
<div class="fn value">
Smith, Douglas R.</div>
Internet Archive identifier