merge-sort
基本解释
- n.归并分类
英汉例句
- Search algorithm, definition of sort, insertion sort, quick sort, optimal sort time, merge sort, Heap sort, radix sort, summarize of sort algorithms.
搜索算法；排序定义；插入排序；快速排序；最优排序时间；归并排序；堆排序；基数排序；排序总结。 - Quick sort and merge sort have the same time complexity on average cases but differ on the worst cases.
快速排序和归并排序在一般情况下有相同的时间复杂度，但是在最坏情况下却有所不同。 - Empirical tests showed it to be as fast as a highly optimized quicksort.A quicksort is generally considered to be faster than a merge sort but isn't stable and doesn't guarantee n log(n) performance.
比如成绩单,一开始可能是按人员的学号顺序排好了的,现在让我们用成绩排,那么你应该保证,本来张三在李四前面,即使他们成绩相同,张三不能跑到李四的后面去。 - The Catenulate Realization Mode of Two-way Merge Sort
二路归并排序的链式实现方式 - The roads merge a kilometre ahead.
这两条道路在前面一公处汇合成一条大道。