Research on Improved Quick Sort Algorithm with Duplicate Value Handling

An improved algorithm based on Quick Sort algorithm research method is proposed to deal with prevailing duplicate values in the sorting of data. The duplicate values are specially processed, which effectively reduces the number of division and greatly reduces the number of recursions. The experimental results show that the time efficiency is improved by more than 50% when dealing with large data than the traditional Quick Sort algorithm without reducing the space efficiency.