本文给出了一种快速排序法。
调试实现快速排序算法。
本文给出一种快速排序方法——数字排序法。
The paper deals with a digit sorting method that is a quick sorting method.
提出了给定待排数据概率分布函数情况下的概率统计分“档”快速排序算法。
Under the condition of given data statistical distribution, a new algorithm for statistical classification and quick sorting was implemented.
快速排序是交换排序的一种方法，是对过程简单的冒泡排序的一种改进算法。
Based on the discussion of quick sort algorithm, a new algorithm, position computing, is proposed.
快速排序，与合并排序，没有结合一步：两个子阵形成一个已经排好序的数组。
Quick sorts, unlike merge sorts, have no combining step: two subarrays form an already-sorted array.
在减少计算时间方面：提出了一种减少时空复杂度的类似快速排序的周游方案；
To the computation time end, a new quick-sort-like path construction method is proposed, which have smaller computation complexity;
对快速排序算法，基于枢轴元素的随机选取这一前提条件，对这一算法进行了时间平均性能的分析。
To the problem of quick-sort, the authors give an average capacity analysis of the algorithm which is based on random choice 'pintle'.
该排序方法不仅在速度上明显快于快速排序法，而且在非均匀分布数据的情况下也明显快于桶排序法。
The method is not only obviously quicker than that of quick sort, but also much quicker than the bucket sorting method, even in the case of non-uniformly distributed data.
但是由于很难在原地进行合并，所以合并排序的内存需求比能够原地进行的排序算法(例如快速排序)更高。
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 describes a new method of fast arranging and matching and indexing for fast correlation attacks based on convolutional codes.
算法分析和实验结果都表明在待排序数据间隔不太大的情况下，迁移排序算法在速度上明显优于快速排序算法。
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.
分析快速排序异步并行算法的排序过程，给出快速排序异步并行算法的多线程实现方式，指出算法多线程实现的特性。
The article, based on asynchronous parallel quick sort algorithm, analyzes the sorting process, gives the multi-thread implment, points out the executing feature.
分析快速排序异步并行算法的排序过程，给出快速排序异步并行算法的多线程实现方式，指出算法多线程实现的特性。
A method for processing arrangement problems is presented, and the self-organization asynchronous parallel implementation of the method is shown.
但是它确实说明了创建一个能够快速排序的表非常简单，并且无需刷新页面，也不需要服务器来执行麻烦无聊的排序工作。
But it does demonstrate that it's easy to put together a table that sorts quickly, without a page refresh and without bothering the server to do the hard, uninteresting work of the sort.
本文最后给出利用三种快速排序方法在IBM—PC机上分别关于均匀分布数据记录和正态分布数据记录进行排序的实验结果。
The experiment results from mean distribution data recordings and normal distribution data recordings with three sorting methods on IBM-PC are given.
本文提出一种可对任意分布的浮点数进行排序的快速排序方法，它基于浮点数的机内编码，具有速度快、实现简单、实用的特点。
This article proposes a quick sort method based on the machine code of floating point numbers, which can sort the floating point numbers distributed at random.
现在，大多数Rexx安装都内置了自己的排序扩展，因此可以方便地为缺少快速排序或冒泡排序的安装定义实现这些排序方法的子例程。
Most modern Rexx installations build in their own sorting extension, and it's easy to define a subroutine that implements quicksort or bubblesort for those which lack it.
但我又不想用调用比较函数的开销，因此只能用宏来实现了。由于快速排序是目前最快的通用排序算法，因此当前选用快速排序算法。
But I also do not want to call the comparison function of the overhead, it can only be used to achieve a macro.
而有项崭新的测试，能让研究人员透过快速排序电极和电解质的组合，以找出可以持续使用到车辆寿终正寝的电池(参见“更快捷的电动汽车电池测试”一文)。
And a new test could allow researchers to quickly sort through combinations of electrodes and electrolytes to find ones that will last for the life of a car (a Quicker test for EV Batteries).
本文在进一步研究快速排序法和位置计算法的基础上，对位置计算法进行了改进，使程序得到了优化，从而提高了运行效率。通过上机实验，获得满意的效果。
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.
不论用哪种搜索，目的都是为了提供统一、相关并排序的结果集，从而可以快速且方便的访问信息。
No matter which type of search, the purpose is to provide a consolidated, correlated, and ranked result set that enables quick and easy access to information.
该功能速度很快，为用户提供如此快速的重新排序，以至于很容易相信该功能对性能有益。
And it? S fast, providing such a quick re-sort for users that it? S easy to believe that the feature is free in terms of performance.
不过通过点击每列上面的列名即可排序，快速的找到你关心的进程。
But you can quickly find which processes might need your attention by using the column listings along the top.
他在圭尔夫的实验室和史密森的分析生物学实验室都可以快速给细胞色素氧化酶(COI)基因排序，进而有“条码工厂”的美称，看来他的计划切实可行。
Both his laboratory at Guelph and the Smithsonian's Laboratories of Analytical Biology can sequence the COI gene rapidly, and have thus been dubbed "barcode factories", so this looks feasible.
正如我所说，二叉树排序是一种非常有效且快速的方法。
As I said, binary trees are a very efficient and fast way of sorting.
正如我所说，二叉树排序是一种非常有效且快速的方法。
As I said, binary trees are a very efficient and fast way of sorting.
应用推荐