(arr1)
| 11 | |
| 12 | # 归并 |
| 13 | def merge_sort(arr1): |
| 14 | if len(arr1) < 2: |
| 15 | return arr1 |
| 16 | half = int(len(arr1) / 2) |
| 17 | left_arr1 = merge_sort(arr1[:half]) |
| 18 | right_arr1 = merge_sort(arr1[half:]) |
| 19 | return merge(left_arr1, right_arr1) |
| 20 | |
| 21 | def merge(left, right): |
| 22 | result = [] |