On the further research of quick sort algorithm and position computing algorithm, the latter one is improved and optimized, thus more effective in data processing.
本文在进一步研究快速排序法和位置计算法的基础上，对位置计算法进行了改进，使程序得到了优化，从而提高了运行效率。通过上机实验，获得满意的效果。
It's proved by algorithm analysis and experimental results that the new sorting algorithm is better than the quick sort when data are in little gap distribution.
算法分析和实验结果都表明在待排序数据间隔不太大的情况下，迁移排序算法在速度上明显优于快速排序算法。
Based on the discussion of quick sort algorithm, a new algorithm, position computing, is proposed.
快速排序是交换排序的一种方法，是对过程简单的冒泡排序的一种改进算法。
应用推荐