Bit-index sort: a fast non-comparison integer sorting algorithm for permutations

[thumbnail of BitIdx-Sort-2.pdf]
Text
· Restricted to Repository staff only
· The Copyright of this document has not been checked yet. This may affect its availability.

Please see our End User Agreement.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Curi-Quintal, L. F., Cadenas Medina, J. and Megson, G. M. (2013) Bit-index sort: a fast non-comparison integer sorting algorithm for permutations. In: International Conference on Technological Advances in Electrical, Electronics and Computer Engineering (TAEECE), 2013, 9-11 May 2013, Konya, pp. 83-87.

Abstract/Summary

This paper describes a fast integer sorting algorithm, herein referred as Bit-index sort, which is a non-comparison sorting algorithm for partial per-mutations, with linear complexity order in execution time. Bit-index sort uses a bit-array to classify input sequences of distinct integers, and exploits built-in bit functions in C compilers supported by machine hardware to retrieve the ordered output sequence. Results show that Bit-index sort outperforms in execution time to quicksort and counting sort algorithms. A parallel approach for Bit-index sort using two simultaneous threads is included, which obtains speedups up to 1.6.

Item Type Conference or Workshop Item (Paper)
URI https://reading-clone.eprints-hosting.org/id/eprint/39935
Refereed Yes
Divisions Science
Uncontrolled Keywords sorting algorithm, permutations, linear complexity, bit-array index, counting leading zeros, counting trailing zeros.
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar