# mergeSort.py
def merge(lst1, lst2, lst3):
# merge sorted lists lst1 and lst2 into lst3
# these indexes keep track of current position in each list
i1, i2, i3 = 0, 0, 0 # all start at the front
n1, n2 = len(lst1), len(lst2)
# Loop while both lst1 and lst2 have more items
while i1 < n1 and i2 < n2:
if lst1[i1] < lst2[i2]: # top of lst1 is smaller
lst3[i3] = lst1[i1] # copy it into current spot in lst3
i1 = i1 + 1
else: # top of lst2 is smaller
lst3[i3] = lst2[i2] # copy it into current spot in lst3
i2 = i2 + 1
i3 = i3 + 1 # item added to lst3, update position
# Here either lst1 or lst2 is done. One of the following loops will
# execute to finish up the merge.
# Copy remaining items (if any) from lst1
while i1 < n1:
lst3[i3] = lst1[i1]
i1 = i1 + 1
i3 = i3 + 1
# Copy remaining items (if any) from lst2
while i2 < n2:
lst3[i3] = lst2[i2]
i2 = i2 + 1
i3 = i3 + 1
#------------------------------------------------------------
def mergeSort(nums):
# Put items of nums in ascending order
n = len(nums)
# Do nothing if nums contains 0 or 1 items
if n > 1:
# split into two sublists
m = n // 2
nums1, nums2 = nums[:m], nums[m:]
# recursively sort each piece
print("sorting the following part1:",nums1)
mergeSort(nums1)
print("sorting the following part2:",nums2)
mergeSort(nums2)
# merge the sorted pieces back into original list
merge(nums1, nums2, nums)