Based on the discussion of quick sort algorithm, a new algorithm, position computing, is proposed.
快速排序是交换排序的一种方法，是对过程简单的冒泡排序的一种改进算法。
The article, based on asynchronous parallel quick sort algorithm, analyzes the sorting process, gives the multi-thread implment, points out the executing feature.
分析快速排序异步并行算法的排序过程，给出快速排序异步并行算法的多线程实现方式，指出算法多线程实现的特性。
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.
本文在进一步研究快速排序法和位置计算法的基础上，对位置计算法进行了改进，使程序得到了优化，从而提高了运行效率。通过上机实验，获得满意的效果。
To the problem of quick-sort, the authors give an average capacity analysis of the algorithm which is based on random choice 'pintle'.
对快速排序算法，基于枢轴元素的随机选取这一前提条件，对这一算法进行了时间平均性能的分析。
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.
算法分析和实验结果都表明在待排序数据间隔不太大的情况下，迁移排序算法在速度上明显优于快速排序算法。
A sort of stabilized and quick tracking algorithm used in the complex background is introduced. The algorithm is improved based on the conventional correlation tracking algorithm.
介绍了一种能稳定快速跟踪复杂背景下目标的算法，该算法在传统相关跟踪算法的基础上进行改进。
A sort of stabilized and quick tracking algorithm used in the complex background is introduced. The algorithm is improved based on the conventional correlation tracking algorithm.
介绍了一种能稳定快速跟踪复杂背景下目标的算法，该算法在传统相关跟踪算法的基础上进行改进。
应用推荐