Skip to main content
Article thumbnail
Location of Repository

Formulation and analysis of in-place MSD radix sort algorithms

By Nasir Al-darwish

Abstract

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 Matesort algorithm is a recast of the classical radixexchange sort, emphasizing the role of in-place partitioning and efficient implementation of bit processing operations. This algorithm is O(k) space and has O(kn) worst-case order of running time, where k is the number of bits needed to encode an element value and n is the number of elements to be sorted. The binary Matesort algorithm is evolved into a number of other algorithms including ‘continuous Matesort’ for handling floating point numbers, and a number o

Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.203
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://jis.sagepub.com/cgi/rep... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.