sort algorithm发音

意思翻译

排序算法

相似词语短语

algorithm───n.算法，运算法则

sort───n.种类；方式；品质；[计]（资料、数据的）分类，排序；vi.分类；协调；交往；vt.将…分类；将…排序；挑选出某物

asystole algorithm───心脏停搏算法

supervised algorithm───有监督算法

algorism algorithm───算法

right sort───正确排序

sort by───[计][WIN,NT]排序依据，排序方式，主要关键字

algorithm design───[计] 算法设计；[计]算法设计

genetic algorithm───遗传算法

双语使用场景

The most glaring example of this is the bubble sort algorithm.───这方面有一个非常著名的例子，就是使用冒泡算法排序。

This is done by using a topological sort algorithm on the graph.───这通过图表中的拓扑排序算法实现。

Debugging realization fast sort algorithm.───调试实现快速排序算法。

Although using a delegate comparison method as the basis of a sort algorithm would be valid, it is not ideal.───虽然此时也可以使用委派比较方法来做为排序演算法的基准，但这种方法并不理想。

Because the comparison code is in a separate procedure, the sort algorithm can be written in a more general way.───因为比较程式码在独立的程序中，因此排序演算法可以以较通用的方式写入。

Think about the locality of reference of the sort algorithm and the data you expect it to run on.───考虑排序算法的引用地址和预期其涉及的数据。

And in among pondered the use direct insertion sort algorithm carries on the arrangement to the inquiry result.───并在其中思考利用直接插入排序算法对查询结果进行排序。关键字：录入，查询，修改，排序。

Indicates that the string comparison must use the string sort algorithm.───指示字符串比较必须使用字符串排序算法。

The sample implements a simple bubble sort algorithm.───示例将实现一个简单的冒泡排序算法。

英语使用场景

To speed up computation, we use Quick Sort algorithm and Insertion Sort algorithm instead of usually used Heap Sort algorithm.

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.

The bubble sort algorithm is simple.

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.

Selection Sort Algorithm source code integrity, and can be used directly.

Heapsort is a kind of quick sort algorithm, the minimum(or maximum) can be found by the greedy algorithm.

The most glaring example of this is the bubble sort algorithm.

This is done by using a topological sort algorithm on the graph.

Based on the discussion of quick sort algorithm, a new algorithm, position computing, is proposed.