快速排序是排序算法中性能较好的一种,但存在对数据有序或者基本有序的情形下的性能瓶颈问题.为此,对比效率同为O(nlbn)的其他排序算法,提出一种新的高效快速排序算法.理论分析和实验数据表明,其性能优于原有的快速排序算法,并且在数据基本有序的状况下依然具有高性能和较强的鲁棒性.%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.
展开▼
