
词语导航
基本信息
词语:合并排序
繁体:合並排序
拼音:hé bìng pái xù
英语翻译
【计】 order by merging; ordering by merging; sequence by mergingsequencing by merging
分词翻译
合并的英语翻译:
unite; ombination; incorporate; amalgamate; annexation; coalitionconsolidation; meld
【计】 conflation; converging; merge; merging
【医】 incorporate; incorporation
【经】 amalgamation; combination; conglomerate; consolidate; embody; fusion
incorporate; integration; merge
排序的英语翻译:
sort; taxis【计】 sequencing; sort; sorting; sorting order
【化】 precedence ordering
翻译例句
1. 例如,如何实现合并排序。
For example, implement merge sort.
2. 合并排序的最差性能和平均性能为o (nlog n)。
Merge sort has o (n log n) worst-case and average-case performance.
3. 接下来的20分钟:编程的问题。例如,如何实现合并排序。
20 minutes: Coding question. For example, implement merge sort.
4. 清单1.使用fork - join库进行合并排序。
Listing 1. Merge-sort using the fork-join library.
5. 半数的线程将会退出同时另一半的线程将会在相邻的分区之间进行合并排序。
Half the threads will exist while the other half will perform merge sorts across adjacent partitions.
6. JDK文档说明,该方法采用修正的合并排序法,保证N*log(N) 的效率。
The JDK documentation indicates that this method gives you a modified mergesort with guaranteed N*log(N) performance.www.wENTiyi.CoM
7. 快速排序,与合并排序,没有结合一步:两个子阵形成一个已经排好序的数组。
Quick sorts, unlike merge sorts, have no combining step: two subarrays form an already-sorted array.
8. 连续空白的行被删除,选项卡将转换为空格,和使用的类文件中的导入指令的合并排序。
Consecutive blank lines are removed, tabs are converted into Spaces, and the using or Import directives within a class file are consolidated and sorted.
9. 但是由于很难在原地进行合并,所以合并排序的内存需求比能够原地进行的排序算法(例如快速排序)更高。
But because the merging is difficult to do in place, generally, it has higher memory requirements than in-place sort algorithms, such as quick-sort.
10. EmadOmara的并行合并排序算法假设了在排序操作的过程中(操作者)对计算机的所有CPU具有完全的访问权限。
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.
11. 合并排序本身并非并行算法,因为它可以顺序执行。当数据集太大,内存无法容纳,必须分片保存的时候,经常使用合并排序。
Merge-sort is not an inherently parallel algorithm, as it can be done sequentially, and is popular when the data set is too large to fit in memory and must be sorted in pieces.
12. 在这些上面再运行归并排序,根据归纳,如果这样是正确的,我将重新得到两个列表,然后我会把它们合并在一起。
Run merge sort on those. By induction, if it does the right thing, I"m going to get back two lists, and I"m going to then merge Them together. Notice what I"m going to do.
13. 在这些上面再运行归并排序,根据归纳,如果这样是正确的,我将重新得到两个列表,然后我会把它们合并在一起。
Run merge sort on those. By induction, if it does the right thing, I"m going to get back two lists, and I"m going to then merge Them together. Notice what I"m going to do.
版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!
