mergesort
12345678910111213141516171819202122232425262728293031323334353637
items = [23, 15, 29, 11, 44, 39, 56, 48, 52, 78, 87, 62, 50]
def mergesort(dataset):
if len(dataset) > 1:
mid = len(dataset) // 2
leftarr = dataset[:mid]
rightarr = dataset[mid:]
mergesort(leftarr)
mergesort(rightarr)
i = 0
j = 0
k = 0
while i < len(leftarr) and j < len(rightarr):
if leftarr[i] < rightarr[j]:
dataset[k] = leftarr[i]
i += 1
else:
dataset[k] = rightarr[j]
j += 1
k += 1
while i < len(leftarr):
dataset[k] = leftarr[i]
i += 1
k += 1
while j < len(rightarr):
dataset[k] = rightarr[j]
j += 1
k += 1
print(items)
mergesort(items)
print(items)
Python
INFO