A Quick Sorting Algorithm Adaptive to Massive Data with High Repetition Rate

摘要

Quick sorting is one of the sorting algorithms with good performance. However, there is a bottleneck of its performance in dealing with massive data with high repetition rate. Therefore, a new effective quick sorting algorithm is proposed in this study. This approach possesses the advantage of conciseness of quick sorting algorithms while avoiding the disadvantages of recursive algorithms. The time complexity is O(n), and the space complexity is O(1). Theoretical analysis and experimental data have shown that its performance is superior to the original quick sorting algorithm, and it is applicable to the processing of massive data with high repetition rate.