Electronic Resource
Springer
Acta informatica
27 (1989), S. 73-80
ISSN:
1432-0525
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Summary 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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00263502
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |