Abstract
Having introduced and illustrated the major construction techniques on some simple problems, we now turn our attention to the more substantial task of sorting. We demonstrate how a selection of different algorithms can be derived from a single specification, but our coverage is by no means exhaustive. Our major concern is the detailed application, and a certain amount of customisation1, of the general transfinement tactics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Parts of this chapter (and Chapter 9) closely follow Darlington, J., “A Synthesis of Several Sorting Algorithms”, Acta. Informatica (11), 1–30 (1978).
Knuth, D.E., The Art of Computer Programming, Vol 3 “Sorting and Searching”, Addison-Wesley (1973).
Burstall, R.M., “Proving Properties of Programs by Structural Induction”, Comp. J. (12), 41–48 (1969).
Rights and permissions
Copyright information
© 2005 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2005). Sorting. In: Constructing Correct Software. Springer, London. https://doi.org/10.1007/1-84628-079-6_8
Download citation
DOI: https://doi.org/10.1007/1-84628-079-6_8
Publisher Name: Springer, London
Print ISBN: 978-1-85233-820-6
Online ISBN: 978-1-84628-079-5
eBook Packages: Computer ScienceComputer Science (R0)