Accession Number:

ADA126086

Title:

The Structure of Divide and Conquer Algorithms.

Descriptive Note:

Technical rept.,

Corporate Author:

NAVAL POSTGRADUATE SCHOOL MONTEREY CA

Personal Author(s):

Report Date:

1983-03-04

Pagination or Media Count:

41.0

Abstract:

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

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE