The design of divide and conquer algorithms (Q760206)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The design of divide and conquer algorithms |
scientific article; zbMATH DE number 3883601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The design of divide and conquer algorithms |
scientific article; zbMATH DE number 3883601 |
Statements
The design of divide and conquer algorithms (English)
0 references
1985
0 references
The structure common to a class of divide and conquer algorithms is represented by a program scheme. A theorem is presented which relates the functionality of a divide and conquer algorithm to its structure and the functionalities of its subalgorithms. Several strategies for designing divide and conquer algorithms arise from this theorem and they are used to formally derive algorithms for sorting a list of numbers, forming the cartesian product of two sets, and finding the convex hull of a set of planar points.
0 references
divide and conquer algorithms
0 references
program scheme
0 references
functionality
0 references
sorting
0 references
cartesian product
0 references
convex hull
0 references
0.7707740068435669
0 references
0.751011073589325
0 references
0.7360532879829407
0 references
0.7285386323928833
0 references
