Debugging realization fast sort algorithm.
调试实现快速排序算法。
The sample implements a simple bubble sort algorithm.
示例将实现一个简单的冒泡排序算法。
The most glaring example of this is the bubble sort algorithm.
这方面有一个非常著名的例子，就是使用冒泡算法排序。
This is done by using a topological sort algorithm on the graph.
这通过图表中的拓扑排序算法实现。
It allows the caller's code to become part of the sort algorithm.
它允许调用方的代码成为排序算法的一部分。
Our methods are illustrated by a proof of a Bubble Sort algorithm.
本文最后以证明冒泡分类算法例示了本文方法的使用情况。
Indicates that the string comparison must use the string sort algorithm.
指示字符串比较必须使用字符串排序算法。
This paper introduces a map sort algorithm with extra memory cost, its time complexity is o (n).
本文介绍了映射式排序算法，这种算法附加一定的存储开销，时间复杂性为O (N)。
For example, a sort algorithm could be passed a reference to the method that compares two objects.
例如，可以向排序算法传递对比较两个对象的方法的引用。
Based on the discussion of quick sort algorithm, a new algorithm, position computing, is proposed.
快速排序是交换排序的一种方法，是对过程简单的冒泡排序的一种改进算法。
Although using a delegate comparison method as the basis of a sort algorithm would be valid, it is not ideal.
虽然将委托比较方法用作排序算法的基础是有效的，但是并不理想。
For example, a reference to a method that compares two objects could be passed as an argument to a sort algorithm.
例如，可以将比较两个物件的方法参照当成引数传递至排序演算法。
In this paper we propose a hash sort algorithm and study the general structure of its mapping function theoretically.
本文提出用构造映射函数实现数据排序的散列算法，从理论上对映射函数的一般构造进行分析和研究。
Emad Omara's parallel merge sort algorithm assumes that you will have full access to the machine's CPUs for the duration of the sorting operation.
EmadOmara的并行合并排序算法假设了在排序操作的过程中(操作者)对计算机的所有CPU具有完全的访问权限。
Several kind of commonly used sort algorithms efficiency comparison, may obtain these kind of sort algorithm through the test the fit and unfit quality, C-C.
几种常用排序算法的效率比较，通过测试可得出这几种排序算法的优劣。
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.
本文在进一步研究快速排序法和位置计算法的基础上，对位置计算法进行了改进，使程序得到了优化，从而提高了运行效率。通过上机实验，获得满意的效果。
PTSA provides many possible choices for all sub-projects in a project which will be arranged in serial or parallel way, so PTSA improves the applied value of Topological Sort Algorithm.
PTSA算法为工程中各子工程的串行或并行安排提供了确定的选择，提升了拓扑排序算法的实用价值。
Instead of parallel bucket sort recommended by some authors, a scheme using parallel regular sampling sort algorithm to construct the finest level data of the distributed tree is presented.
研究了最细层数据的建立方法，提出采用并行正则采样排序算法来代替众多文献所推荐的并行桶排序算法，以此来建立分布树的最细层数据。
It introduces data sort algorithm and process for sorting and optimizing of The Sour Rolling Mill nerve network model, and importantly analyse Simplex and its application on sample data sort.
介绍了酸轧机组神经网络模型的数据筛选算法及筛选优化过程，重点分析了单纯形算法及其在样本数据筛选过程中的应用。
An algorithm was designed to sort the headset EEG signals into either meditation or attention inputs, each with their own distinct pattern.
编码团队设计了一种算法，把耳机采集到的脑电图信号分为沉思和关注两类。
Where those pieces, I would do the same thing with, I would divide them up into smaller chunks, and sort those. Is that going to give me a more efficient algorithm?
合并起来，而那些小列表，我又会把他们拆成更小的列表，再排序，这会给我，一个更高效的算法么？
In a sense, xml2struct.py is already a sort of compression algorithm (it produces somewhat smaller files), but the real point is not to use it directly but as a foundation for further compression.
从某种意义上，xml2struct . py已经是一种压缩算法(它生成了相对较小的文件)，但真正要点是并非直接使用它而是将其作为进一步压缩的基础。
Merge-sort is not an inherently parallel algorithm, as it can be done sequentially, and is popular when the data set is too large to fit in memory and must be sorted in pieces.
合并排序本身并非并行算法，因为它可以顺序执行。当数据集太大，内存无法容纳，必须分片保存的时候，经常使用合并排序。
Implement an algorithm to sort an array. Why did you pick the method you did?
实现算法分类一个阵列。你为什么挑你做的方法？
Knowing that detail, we can then speed the sort up by switching to an algorithm optimized for that exact scenario with nothing but a simple reassignment.
了解细节，针对确切的场景，我们可以通过切换算法来加快排序，仅仅只需一次简单的再赋值即可。
Compared with the scan line algorithm, it has a simple data structure, no need to maintain and sort lots of tables, simple implementation, and fitting for being implemented by hardware.
该算法和扫描线算法相比，具有数据结构简单，不需要对众多的表格进行维护和排序，实现思想简洁和适合硬化等优点。
In addition, a new sort thought solving the electronic homework auto-checking problem is given as well as a basic electronic homework auto-checking algorithm.
另外，本文还提出用分类的思想解决电子作业自动批改的问题，给出了一个基本的电子作业自动批改算法。
This sorting algorithm is only marginally more difficult than bubble sort to implement.
这个排序算法实现起来只是略微比冒泡排序复杂一些。
This sorting algorithm is only marginally more difficult than bubble sort to implement.
这个排序算法实现起来只是略微比冒泡排序复杂一些。
应用推荐