调试实现快速排序算法。
提出了给定待排数据概率分布函数情况下的概率统计分“档”快速排序算法。
Under the condition of given data statistical distribution, a new algorithm for statistical classification and quick sorting was implemented.
对快速排序算法，基于枢轴元素的随机选取这一前提条件，对这一算法进行了时间平均性能的分析。
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.
但我又不想用调用比较函数的开销，因此只能用宏来实现了。由于快速排序是目前最快的通用排序算法，因此当前选用快速排序算法。
But I also do not want to call the comparison function of the overhead, it can only be used to achieve a macro.
但是由于很难在原地进行合并，所以合并排序的内存需求比能够原地进行的排序算法(例如快速排序)更高。
But because the merging is difficult to do in place, generally, it has higher memory requirements than in-place sort algorithms, such as quick-sort.
介绍了带有限期作业排序问题的概念，以及使用贪心方法求解此问题的一般算法和一种改进的快速算法。
This paper introduces the concept about the question of job scheduling with time limit, a general method of solving this question using greedy method and a fast algorithm which is improved.
分析快速排序异步并行算法的排序过程，给出快速排序异步并行算法的多线程实现方式，指出算法多线程实现的特性。
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.
快速排序是交换排序的一种方法，是对过程简单的冒泡排序的一种改进算法。
Based on the discussion of quick sort algorithm, a new algorithm, position computing, is proposed.
在分析基于卷积码的快速相关攻击算法时，提出了快速排序匹配索引算法，用以寻找重量较小的一致校验方程。
This paper describes a new method of fast arranging and matching and indexing for fast correlation attacks based on convolutional codes.
分析快速排序异步并行算法的排序过程，给出快速排序异步并行算法的多线程实现方式，指出算法多线程实现的特性。
A method for processing arrangement problems is presented, and the self-organization asynchronous parallel implementation of the method is shown.
在综合多种算法优点的基础上，首先提出了对三角面片的顶点按其切片方向进行从小到大排序，以快速滤除冗余顶点；
Firstly, sorting the apex of the triangular facets according to ascending order in their slice direction was proposed to filter out redundant vertex quickly;
在综合多种算法优点的基础上，首先提出了对三角面片的顶点按其切片方向进行从小到大排序，以快速滤除冗余顶点；
Firstly, sorting the apex of the triangular facets according to ascending order in their slice direction was proposed to filter out redundant vertex quickly;
应用推荐