2006•Computer Engineering and Applications JournalRequires access
Super Quick Sort Algorithm
Jianqin Zhou
Open publisher page 0 citations
Abstract
Sorting algorithms have been widely studied in both theory and algorithm design.A new practical in-place sorting algorithm,called super quick sort,is obtained by merging some characteristics of radix sort and quick sort.Both theoretical analysis and experimental tests confirm the merits of super quick sort.The time complexity and space complexity of the new algorithm is much better than that of both radix sort and quick sort.