Abstract
This chapter examines three different sorts. The first is one of the simpler ones, the insertion sort. The second is one of the fastest sorts, the quick sort. The third is called the radix (or bucket) sort and can be used for sorting physical items, but can also be adapted to sort items in memory as well. Al three sorts are illustrated using diagrams and include an elementary analysis of the algorithms. The complete program uses the quick sort to sort string items.
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 subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Streib, J.T., Soma, T. (2017). Sorting. In: Guide to Data Structures. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-70085-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-70085-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70083-0
Online ISBN: 978-3-319-70085-4
eBook Packages: Computer ScienceComputer Science (R0)