Abstract
If there are available 100 numbers, not arranged in any order of magnitude, we can sort them into ascending order by a computer method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1969 O. B. Chedzoy and Sandra E. Ford
About this chapter
Cite this chapter
Chedzoy, O.B., Ford, S.E. (1969). Sorting Numbers. In: Programming by Case Studies. Introductory Monographs in Mathematics. Palgrave Macmillan, London. https://doi.org/10.1007/978-1-349-00700-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-349-00700-4_3
Publisher Name: Palgrave Macmillan, London
Print ISBN: 978-0-333-10146-9
Online ISBN: 978-1-349-00700-4
eBook Packages: Computer ScienceComputer Science (R0)