GeezerVison is showing github.com — Python/MergeSort.py at master · macndesign/Python

Expand file tree

MergeSort.py

Copy path

More file actions

36 lines (32 loc) · 857 Bytes

Copy path

36 lines (32 loc) · 857 Bytes

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

def mergeSort(alist):

print("Splitting ",alist)

if len(alist)>1:

mid = len(alist)//2

lefthalf = alist[:mid]

righthalf = alist[mid:]

mergeSort(lefthalf)

mergeSort(righthalf)

i=0

j=0

k=0

while i < len(lefthalf) and j < len(righthalf):

if lefthalf[i] < righthalf[j]:

alist[k]=lefthalf[i]

i=i+1

else:

alist[k]=righthalf[j]

j=j+1

k=k+1

while i < len(lefthalf):

alist[k]=lefthalf[i]

i=i+1

k=k+1

while j < len(righthalf):

alist[k]=righthalf[j]

j=j+1

k=k+1

print("Merging ",alist)

print("Enter numbers seprated by space")

s = input()

numbers = list(map(int, s.split()))

mergeSort(numbers)