An introduction to three algorithms for sorting in situ

The purpose of this paper is to give a crisp introduction to three algorithms for sorting in situ, viz. insertion sort, heapsort and smoothsort. The more complicated the algorithm, the more elaborate the justification for the design decisions embodied by it. In passing we offer a style for the prese...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 1982-10, Vol.15 (3), p.129-134
Main Authors: Dijkstra, Edsger W., van Gasteren, A.J.M.
Format: Article
Language:English
Subjects:
Algorithms
Computer programming
Computer science
heapsort
Information processing
Insertion sort
presentation of programs
smoothsort
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The purpose of this paper is to give a crisp introduction to three algorithms for sorting in situ, viz. insertion sort, heapsort and smoothsort. The more complicated the algorithm, the more elaborate the justification for the design decisions embodied by it. In passing we offer a style for the presentation of non-trivial algorithms that seems to have its merits.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(82)90045-X