(arr)
| 76 | |
| 77 | |
| 78 | def mergeSort(arr): |
| 79 | import math |
| 80 | if (len(arr) < 2): |
| 81 | return arr |
| 82 | middle = math.floor(len(arr) / 2) |
| 83 | left, right = arr[0:middle], arr[middle:] |
| 84 | return merge(mergeSort(left), mergeSort(right)) |
| 85 | |
| 86 | |
| 87 | def merge(left, right): |