merge-sort
基本解釋
- n.歸并分類(lèi)
英漢例句
- Search algorithm, definition of sort, insertion sort, quick sort, optimal sort time, merge sort, Heap sort, radix sort, summarize of sort algorithms.
搜索算法；排序定義；插入排序；快速排序；最優(yōu)排序時(shí)間；歸并排序；堆排序；基數(shù)排序；排序總結(jié)。 - Quick sort and merge sort have the same time complexity on average cases but differ on the worst cases.
快速排序和歸并排序在一般情況下有相同的時(shí)間復(fù)雜度，但是在最壞情況下卻有所不同。 - 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.
比如成績(jī)單,一開(kāi)始可能是按人員的學(xué)號(hào)順序排好了的,現(xiàn)在讓我們用成績(jī)排,那么你應(yīng)該保證,本來(lái)張三在李四前面,即使他們成績(jī)相同,張三不能跑到李四的后面去。 - The Catenulate Realization Mode of Two-way Merge Sort
二路歸并排序的鏈?zhǔn)綄?shí)現(xiàn)方式 - The roads merge a kilometre ahead.
這兩條道路在前面一公處匯合成一條大道。