Advertising
Register for free: access more results and features
sorting algorithm
Definition
Translation of "sorting algorithm" in Chinese
Definition NEW
排序算法
分类算法
The sorting algorithm needs to be done in two parts.
排序算法需要分两部分进行。
Computing these probabilities analytically is difficult, since it depends on knowing the exact sorting algorithm used.
分析计算这些概率是困难的，因为它取决于知道使用的确切排序算法。
A sorting algorithm was applied to efficiently classify the customer data.
我们应用了一种分类算法，高效地对客户数据进行归类。
For example, a resume or application sorting algorithm that simply learns from historical data and the regenerates that old-fashioned decision-making is merely codifying all the biases that the system had, whether it's sexism, or an over-reliance on certain college degrees.
比如说，简历或应用分类算法如果只是从历史数据中学习，而且只会再次产生老式的决策方式，那么这种方法也只是编撰整理了系统原有的偏见，无论是性别歧视，还是对某些大学学位的偏好。
To remember from several classical sorting algorithm pseudo code
可以默写出几种经典排序算法的伪代码
If it is discovered that the available memory is less than instructed number through sorting algorithm, the data paging will be transferred to disk.
如果排序算法发现可用的内存比少于指示的数值小，则会将数据分页传递到磁盘中。
The sorting algorithm arranged the data in perfect order.
这个排序算法把数据整理得井井有条。
A sorting algorithm is called stable if the relative order of elements with the same key value is preserved by the algorithm after sorting is performed.
如果在执行排序后算法保留具有相同键值的元素的相对顺序，则这个排序算法称为稳定的排序。
Before we move on, let's contrast quicksort with another well-known sorting algorithm: mergesort.
在我们继续下去之前，让我们将快速排序与另一个众所周知的排序算法 - 归并排序进行对比。
View the visualisation/animation of the chosen sorting algorithm here.
在此处查看所选排序算法的可视化/动画
These sorting algorithms can be faster than the lower bound of comparison-based sorting algorithm of Ω(N log N) by not comparing the items of the array.
这些排序算法可以通过不比较数组的项目来比时间复杂度为Ω（N log N）的基于比较的排序算法的下限更快。
This algorithm is useful for small sets of data and even if it doesn't look like the most effective sorting algorithm, insertion sort can be useful for some reasons.
插入排序对小数据集是很有效的。即使插入排序并非是最有效的排序算法，但是它也很有用，原因有如下三点：
There are log N levels and in each level, we perform O(N) work, thus the overall time complexity is O(N log N). We will later see that this is an optimal (comparison-based) sorting algorithm, i.e. we cannot do better than this.
有 log（N） 个日志级别，每个级别都执行O（N）工作，因此总体时间复杂度为O（N log N）。 稍后我们会看到这是一种最佳（基于比较）的排序算法，即我们无法做得比这更好。
Synonyms and analogies of "sorting algorithm" in English
Word & Expression of the day
Image of the day
Results: 30. Exact: 30. Elapsed time: 13 ms.
