这个枚举器将使用比较器作为排序算法，从记录存储创建一个记录结果集。
The enumerator will create a result set of records from the record store, using the comparator as the sorting algorithm.
调用应用程序提供的算法：C运行时库函数qsort 排序对象数组，但你必须提供比较函数。
To Invoke an Application-Supplied Algorithm The C runtime library function qsort sorts an array of objects, but you must supply the function that compares objects.
指示字符串比较必须使用字符串排序算法。
Indicates that the string comparison must use the string sort algorithm.
例如，可以向排序算法传递对比较两个对象的方法的引用。
For example, a sort algorithm could be passed a reference to the method that compares two objects.
虽然将委托比较方法用作排序算法的基础是有效的，但是并不理想。
Although using a delegate comparison method as the basis of a sort algorithm would be valid, it is not ideal.
它是一种基于冒泡排序的比较算法，它们有着许多共同点。
It is a comparison sort based on bubble sort with which it shares many characteristics.
几种常用排序算法的效率比较，通过测试可得出这几种排序算法的优劣。
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.
例如，可以将比较两个物件的方法参照当成引数传递至排序演算法。
For example, a reference to a method that compares two objects could be passed as an argument to a sort algorithm.
二路归并排序算法的思想比较容易理解。
It is easy to understand the concept of 2-way merge sort algorithms.
在比较网络模型的基础上，该算法使用二分法思想，利用双调序列，构造出了一种并行的排序算法：双调排序网络。
Base on comparing net model, it constructs a kind of pallel sorting algorithm bitonic sorting net, taking advantage of dichotomy ideas and bitonic serial.
但我又不想用调用比较函数的开销，因此只能用宏来实现了。由于快速排序是目前最快的通用排序算法，因此当前选用快速排序算法。
But I also do not want to call the comparison function of the overhead, it can only be used to achieve a macro.
结合小间隔数据的特点，提出了一种谓之迁移的新排序方法(以下简称为迁移排序)，给出了该排序算法的描述、时间复杂度分析及用汇编语言编写程序进行算法比较的实验结果。
A new sorting method, the method of transfer sort for special distributed data is presented. Its algorithm description, time complexity and experimental results in assembler language are given.
结合小间隔数据的特点，提出了一种谓之迁移的新排序方法(以下简称为迁移排序)，给出了该排序算法的描述、时间复杂度分析及用汇编语言编写程序进行算法比较的实验结果。
A new sorting method, the method of transfer sort for special distributed data is presented. Its algorithm description, time complexity and experimental results in assembler language are given.
应用推荐