This paper describes a fast integer sorting algorithm, herein referred to as bit-index sort, which does not use comparisons and is intended to sort partial permutations. Experimental results exhibit linear complexity ...
详细信息
ISBN:
(纸本)9781467356138;9781467356121
This paper describes a fast integer sorting algorithm, herein referred to as bit-index sort, which does not use comparisons and is intended to sort partial permutations. Experimental results exhibit 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 quicksort and counting sort algorithms when compared in their execution time. A parallel approach for bit-index sort using two simultaneous threads is also included, which obtains further speedups of up to 1.6 compared to its sequential case.
This paper describes a fast integer sorting algorithm, herein referred to as bit-index sort, which does not use comparisons and is intended to sort partial permutations. Experimental results exhibit linear complexity ...
详细信息
ISBN:
(纸本)9781467356121
This paper describes a fast integer sorting algorithm, herein referred to as bit-index sort, which does not use comparisons and is intended to sort partial permutations. Experimental results exhibit 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 quicksort and counting sort algorithms when compared in their execution time. A parallel approach for bit-index sort using two simultaneous threads is also included, which obtains further speedups of up to 1.6 compared to its sequential case.
暂无评论