Randomized Signature Sort: Implementation and Performance Analysis
Tamana Pathak, Deepak Garg · International Journal of Computer Applications · 2011
Recently the lower bound for integer sorting has considerably improved and achieved with comparison sorting to [1] for a deterministic algorithms or to for a radix sort algorithm in space that depends only on the number of input integers.Andersson et al. [2] presented signature sort in the expected linear time and space which gives very bad performance than randomized quick sort.We earlier presented in [14] that performance of signature sort can be enhanced using hashing and bitwise operators.This paper gives the implementation of that idea and later we have compared the performance of algorithm with existing randomized signature sort and randomized quick Sort.