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. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
APA
Alt, H. (2011). Fast sorting algorithms. In Algorithms Unplugged (pp. 17–25). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free