Gesproken tekst vertalen, offlinefuncties, synoniemen, vervoegingen, educatieve spelletjes
Publiciteit
Registreer gratis: toegang tot meer resultaten en functies
sorting algorithms
Vertaling van "sorting algorithms" in Chinees
There are many different sorting algorithms, each has its own advantages and limitations.
有许多不同的排序算法，每个都有其自身的优点和局限性。
Sorted data can dramatically change the speed of our program, therefore sorting algorithms are something quite special in computer science.
排序过的数据能显著地改变程序的运行速度，因而在计算机科学中排序算法是一类比较特别的东西。
It includes sorting algorithms, developed by the author, for use with random alphanumerical and numerical data key fields.
它包括了排序算法，由作者开发的，可用于随机的文字数字和数字数据关键字。
In this section, we will talk about in-place versus not in-place, stable versus not stable, and caching performance of sorting algorithms.
在本节中，我们将讨论就地与非就地，稳定与不稳定以及高速缓存排序算法的性能。
We will discuss two (+half) comparison-based sorting algorithms in the next few slides
我们将在接下来的几张幻灯片中讨论两种（加一半）基于比较的排序算法：
This algorithm is very simple and very intuitive to implement, but unfortunately it is not so effective compared to other sorting algorithms as quicksort and merge sort.
插入排序非常简单，而且易于实现，但是遗憾的是，与其他诸如快速排序、归并排序等排序算法相比，它不是很有效。
Unstable sorting algorithms can be specially implemented to be stable.
不穩定排序算法可以被特別地實作為穩定。
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）的基于比较的排序算法的下限更快。
It is known (also not proven in this visualization as it will take another 1 hour lecture to do so) that all comparison-based sorting algorithms have a lower bound time complexity of Ω(N log N).
我们都知道（在这个可视化中也没有证明，因为它需要花费一个小时的讲座来证明），所有基于比较的排序算法都具有Ω（N log N）的下限时间复杂度。
Unfortunately, there are no clear rules. The sorting algorithms are kept secret by the search engine providers to avoid manipulation and they are often altered.
可惜对此没有明确的规则，因为搜索引擎的排序算法是保密的，以防止篡改，并且算法经常被改动。
Actually, the C++ source code for many of these basic sorting algorithms are already scattered throughout these e-Lecture slides. For other programming languages, you can translate the given C++ source code to the other programming language.
实际上，许多这些基本排序算法的C ++源代码已经分散在这些电子讲座幻灯片中。对于其他编程语言，您可以将给定的C ++源代码翻译为其他编程语言。
These three sorting algorithms are the easiest to implement but also not the most efficient, as they run in O(N2).
这三种排序算法最容易实现，但不是最有效的，因为它们的时间复杂度是O（N2）。
Merge Sort is therefore very suitable to sort extremely large number of inputs as O(N log N) grows much slower than the O(N2) sorting algorithms that we have discussed earlier.
因此，归并排序非常适合分类非常大量的输入，因为O（N log N）比前面讨论的O（N2）排序算法增长得慢得多。
Synoniemen voor sorting algorithms in het Engels
Woord & uitdrukking van de dag
Afbeelding van de dag
Resultaten: 24. Exact: 24. Verstreken tijd: 15 ms.
