Fast in-place integer radix sorting

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 sublinear 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. © Springer-Verlag Berlin Heidelberg 2005.