Skip to main content
  • 16 Accesses

Abstract

We now come to the second set of sorts that use methods other than selection, exchanging or counting to rank an input list. This book covers only one distributive sort in detail but another is discussed; this is because they use features not normally accessible to everyone on a microcomputer.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Copyright information

© 1986 Keith McLuckie and Angus Barber

About this chapter

Cite this chapter

McLuckie, K., Barber, A. (1986). Distributive Sorts. In: Sorting Routines for Microcomputers. Palgrave, London. https://doi.org/10.1007/978-1-349-08147-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-08147-9_9

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-39587-5

  • Online ISBN: 978-1-349-08147-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics