Sorting Morphisms

Sorting Morphisms (1998)

by Lex Augusteijn

Venue:	3rd International Summer School on Advanced Functional Programming, volume 1608 of LNCS
Citations:	23 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Sorting Morphisms	user correction - Legacy Corrections
AUTHOR NAME	Lex Augusteijn	SVM HeaderParse 0.1
AUTHOR AFFIL	Philips Research Laboratories, Eindhoven	SVM HeaderParse 0.2
ABSTRACT	. Sorting algorithms can be classified in many different ways. The way presented here is by expressing the algorithms as functional programs and to classify them by means of their recursion patterns. These patterns on their turn can be classified as the natural recursion patterns that destruct or construct a given data-type, the so called cata- and anamorphisms respectively. We show that the selection of the recursion pattern can be seen as the major design decision, in most cases leaving no more room for more decisions in the design of the sorting algorithm. It is also shown that the use of alternative data structures may lead to new sorting algorithms. This presentation also serves as a gentle, light-weight, introduction into the various morphisms. 1 Introduction In this paper we present several well known sorting algorithms, namely insertion sort, straight selection sort, bubble sort, quick sort, heap sort and merge sort (see e.g. [Knu73, Wir76]) in a non-standard way. We express...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE	3rd International Summer School on Advanced Functional Programming, volume 1608 of LNCS	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	1--27	INFERENCE
VOLUME	1608	INFERENCE
CITATIONS	9 found	ParsCit 1.0