Accessibility navigation


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

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.

[img] Text
· Restricted to Repository staff only
· The Copyright of this document has not been checked yet. This may affect its availability.

821kB

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

Official URL: http://dx.doi.org/10.1109/TAEECE.2013.6557200

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)
Refereed:Yes
Divisions:Faculty of Science
ID Code:39935
Uncontrolled Keywords:sorting algorithm, permutations, linear complexity, bit-array index, counting leading zeros, counting trailing zeros.

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

Page navigation