Abstract
This chapter presents two sorting algorithms – Mergesort and Quicksort – that work quickly even for a large number of objects. The author explains the algorithms, compares them theoretically, and suggests how they can be coded.
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Alt, H. (2011). Fast Sorting Algorithms. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15327-3
Online ISBN: 978-3-642-15328-0
eBook Packages: Computer ScienceComputer Science (R0)