(splitedList)
| 97 | |
| 98 | |
| 99 | def reduce(splitedList): |
| 100 | length = len(splitedList) |
| 101 | if length == 1: |
| 102 | return splitedList[0] |
| 103 | |
| 104 | middle = length // 2 |
| 105 | left = reduce(splitedList[:middle]) |
| 106 | right = reduce(splitedList[middle:]) |
| 107 | |
| 108 | return combined(left, right) |
| 109 | |
| 110 | |
| 111 | def mergeSort(shuffledList): |