1、Let's do selection and let's do merge sort here on the right just to see what actually happens.
中間進(jìn)行選擇排序，右邊進(jìn)行歸并排序，看看會(huì)發(fā)生什么。

2、Let's run merge sort on it, and then we'll look at the code.
讓我們?cè)谶@個(gè)列表上運(yùn)行歸并排序，然后我們?cè)诳匆幌麓a。

3、It is easy to understand the concept of 2-way merge sort algorithms.
二路歸并排序算法的思想比較容易理解。

4、Merge sort has o worst-case and average-case performance.
合并排序的最差性能和平均性能為o (nlog n)。

merge sort翻譯