您要查找的是不是：
- Debugging realization fast sort algorithm. 调试实现快速排序算法。
- It allows the caller's code to become part of the sort algorithm. 它允许调用方的代码成为排序算法的一部分。
- Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity. 编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。
- Indicates that the string comparison must use the string sort algorithm. 指示字符串比较必须使用字符串排序算法。
- 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. 拓扑排序算法既可以用于连通图，也可以用于非连通图。
- Shaffer (A Practical Introduction to Data Structures and Algorithm Analysis, Second Edition, Clifford A. l 数据结构与算法分析（C++版）（第二版）Clifford A.
- I learned how to use the common data sorting algorithms in C. 我学会了使用C语言编写常用的数据排序算法。
- LI Yu-bai, PENG Qi-cong.Software implementation and algorithm analysis of DDC[J].Journal of China Institute of Communications, 2000,21 (10): 44- 49. [9]李玉柏;彭启琮.;软件数字下变频的实现与算法分析[J]
- 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。
- A design flow with block modeling, algorithm analysis, structure planning, behavioral description, verification, synthesis and documentation is used to design the HEC block set. 采用元件建模、算法推导、结构规划，行为描述、功能验证、综合优化及文档制备的设计流程，得到了适于并行实时实现的信头差错控制模块组。
- User task requirements are formed into WDAG, which is grouped into TGTs. Sort algorithm is applied to TGT. 将用户任务请求构成WDAG图,随后给出分组算法对WDAG进行分组,构成TGT。
- This paper introduces a map sort algorithm with extra memory cost, its time complexity is O(N). 本文介绍了映射式排序算法,这种算法附加一定的存储开销,时间复杂性为O(N)。
- Sorting is very important when dealing with data.The sorting algorithm has great influence on the complexness of your program. 排序在数据处理中占有极重要的位置,排序算法的好坏,直接影响到实现的复杂度。
- The concept of in-place quicksort binary tree has great theoretical and practical reference value to the research and improvement of sorting algorithm. 原地快速排序二叉树的概念对排序算法的研究和改进具有很好的理论和实用参考价值。
- This paper presents a new simple quick sorting algorithm and compares the performanee of the algorithm with that of quick sorting algorithm. 提出了一种简单快速的新的排序算法，并对其性能与快速排序算法的性能进行了实验比较.
- The study of this paper places emphasis on the block of signal processing in the IF and the block of base signal processing, and gives special details of algorithm analysis and realized techniques in ADC, DDC and DSP. 本文重点研究了接收机的中频处理和基带处理模块,对其关键的模数转换器(ADC)、数字下变频器(DDC)和数字信号处理器(DSP)部分进行了算法研究和实现分析。
- Using assembly language to achieve the Bubble Sort algorithm procedures. Pai 20 positive integer. 用汇编语言实现的冒泡排序算法程序。排20个正整数。
