merge_sort.py

classMergeSort(object):
def__init__(self, numbers):
self.values=numbers
self.count=len(numbers)

defsort(self):
self.merge_sort(0, self.count-1)
returnself.values

defmerge_sort(self, low, high):
iflow<high:
mid= (low+high) //2

self.merge_sort(low, mid)
self.merge_sort(mid+1, high)
self.merge(low, mid, high)

defmerge(self, low, mid, high):
b= []
i=low
j=mid+1

whilei<=midandj<=high:
ifself.values[i] <=self.values[j]:
b.append(self.values[i])
i+=1
else:
b.append(self.values[j])
j+=1

whilei<=mid:
b.append(self.values[i])
i+=1

whilej<=high:
b.append(self.values[j])
j+=1

forindex, valinenumerate(b):
self.values[low+index] =val