A note on synthesis and classification of sorting algorithms (Q1118415)
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: A note on synthesis and classification of sorting algorithms |
scientific article; zbMATH DE number 4094833
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on synthesis and classification of sorting algorithms |
scientific article; zbMATH DE number 4094833 |
Statements
A note on synthesis and classification of sorting algorithms (English)
0 references
1989
0 references
Sorting algorithms are traditionally classified according to their main operational characteristic. More recently, program synthesis has been used as a basis for classification. We briefly survey previous work in the synthesis and classification of sorting algorithms, and outline a more comprehensive scheme derived by synthesising many sorting algorithms in a top-down fashion on a semi-automated logic programming system.
0 references
program synthesis
0 references
classification
0 references
sorting algorithms
0 references
semi-automated logic programming
0 references