归并排序(Merge Sort) A merge sort works as follows: If the list is of length o or 1,then it is already sorted. Otherwise: Divide the unsorted list into two sublists of about half the size. 米 Sort each sublist recursively by re-applying the merge sort. Merge the two sublists back into one sorted list. 2011/10/25 A merge sort works as follows:  If the list is of length 0 or 1, then it is already sorted. Otherwise:  Divide the unsorted list into two sublists of about half the size.  Sort each sublist recursively by re‐applying the merge sort.  Merge the two sublists back into one sorted list. 归并排序（Merge Sort） 5 2011/10/25