Study of High Efficiency Quick Sort Algorithm
Tang Ya-ling, Feng Qin · Jisuanji gongcheng · 2011
Quick sort works fairly efficiently contrasting with other sort algorithms,but it has choke point when sorted data are in order or basically in order.This paper brings forward a new high efficient quick sort algorithm comparing with several algorithms whose performances are O(nlbn).And on theory analysis as well as experiment data,it proves fairly good sort performance and strong robustness even in case of data sorted or basically in order comparing with other sort algorithms.