Abstract
In this chapter the author deals with simple sorting strategies. These are based on pairwise comparisons and flips of neighboring objects until all objects are sorted. However, these strategies only work well for a small number of objects since the sorting work quickly grows for larger numbers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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
Kowalk, W.P. (2011). Insertion Sort. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_2
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)