Abstract
This paper presents two very efficient sorting algorithms. MSL is an O(N*B) in-place radix sorting algorithm, where N is the input size and B is the keys length in bits. This paper presents an implementation of MSL that is sub-linear in practice, for uniform data, on Pentium 4 machines. We also present an O(N*logN) hybrid quicksort that has a non-quadratic worst case.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Amer, A.-B., Fouad, E.-A.: Efficient In-Place Radix Sorting. Informatica 15(3), 295–302 (2004)
Bentley, J.L., McIlroy, M.D.: Engineering a Sort Function. Software-Practice and Experience 23(1), 1249–1265 (1993)
El-Aker, F., Al-Badarneh, A.: MSL: An Efficient Adaptive In-place Radix Sorting Algorithm. In: ICCS, Part II, pp. 606–609 (2004)
Maus, A.: ARL: A Faster In-place, Cache Friendly Sorting Algorithm. In: Norsk Informatikkonferranse, NIK 2002, pp. 85–95 (2002)
Rahman, N., Raman, R.: Adapting radix sort to the memory hierarchy. In: Proc. 2nd Workshop on Algorithm Engineering and Experiments, ALENEX (2000)
Sedgewick, R.: Algorithms in Java, Parts 1-4, 3rd edn. Addison-Wesley, Reading (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
El-Aker, F. (2005). Fast In-place Integer Radix Sorting. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428862_107
Download citation
DOI: https://doi.org/10.1007/11428862_107
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26044-8
Online ISBN: 978-3-540-32118-7
eBook Packages: Computer ScienceComputer Science (R0)