(self, low, high)
| 8 | return self.values |
| 9 | |
| 10 | def merge_sort(self, low, high): |
| 11 | if low < high: |
| 12 | mid = (low + high) // 2 |
| 13 | |
| 14 | self.merge_sort(low, mid) |
| 15 | self.merge_sort(mid + 1, high) |
| 16 | self.merge(low, mid, high) |
| 17 | |
| 18 | def merge(self, low, mid, high): |
| 19 | b = [] |