Formulation and analysis of in-place MSD radix sort algorithms


We present a unified treatment of a number of related inplace MSD radix sort algorithms with varying radices, collectively referred to here as ‘Matesort’ algorithms. These algorithms use the idea of in-place partitioning which is a considerable improvement over the traditional linked list implementation of radix sort that uses O(n) space. The binary… (More)
DOI: 10.1177/0165551505057007


5 Figures and Tables