您要查找的是不是：
- LINEAR RECURRENCE AND PARALLEL SORTING ALGORITHM 线性递归并行排序算法
- A New Parallel Sorting Algorithm on the Linear Array 线性阵列上的一种新的并行排序算法
- THSORT: A Single-Processor Parallel Sorting Algorithm 单机并行排序算法
- A Class of New Parallel Sorting Algorithms 一类新的并行排序算法
- A Fast Parallel Sorting Algorithm Based on the Reconfigurable Optical Pipeline Bus 基于流水光总线阵列的快速并行排序算法
- Parallel Sorting Algorithm on Reconfigurable Computational Model with Wide Bus Network 带有宽总线网络的可重构计算模型上的并行排序算法
- parallel sorting algorithm 并行排序算法
- Debugging realization fast sort algorithm. 调试实现快速排序算法。
- It allows the caller's code to become part of the sort algorithm. 它允许调用方的代码成为排序算法的一部分。
- Indicates that the string comparison must use the string sort algorithm. 指示字符串比较必须使用字符串排序算法。
- An implementation method of MSD radix sort is presented. Compared to other implementation methods of radix sort, it is easy to be extended to asynchronous parallel radix sort algorithm. 给出了最高位优先基数排序算法的一种实现算法，与其它的实现方法相比，该方法易于扩展为异步并行基数排序算法.
- I learned how to use the common data sorting algorithms in C. 我学会了使用C语言编写常用的数据排序算法。
- The sorting result of Bquick sorting algorithm is also compared with the theory lowerbound. 并对其排序结果与理论下界作了比较。
- The topological sorting algorithm works on unconnected graphs as well as connected graphs. 拓扑排序算法既可以用于连通图，也可以用于非连通图。
- Think about the locality of reference of the sort algorithm and the data you expect it to run on. 考虑排序算法的引用地址和预期其涉及的数据。
- For example, a sort algorithm could be passed a reference to the method that compares two objects. 例如,可以向排序算法传递对比较两个对象的方法的引用。
- For example, if you are implementing a generic sort algorithm, you might want to ensure that the type that you're sorting implements IComparible. 例如,如果实现一种泛型排序算法,则可能希望确保排序的类型实现Icomparible。
- User task requirements are formed into WDAG, which is grouped into TGTs. Sort algorithm is applied to TGT. 将用户任务请求构成WDAG图,随后给出分组算法对WDAG进行分组,构成TGT。
- parallel sorting by regular sampling 并行正则采样排序
- This paper introduces a map sort algorithm with extra memory cost, its time complexity is O(N). 本文介绍了映射式排序算法,这种算法附加一定的存储开销,时间复杂性为O(N)。
