FilesExpand file tree

 master

/

MergeSort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

31 lines (27 loc) · 766 Bytes

 master

/

MergeSort.py

Copy path

Top

File metadata and controls

• Code
• Blame

31 lines (27 loc) · 766 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

def mergeSort(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 += 1

else:

alist[k] = righthalf[j]

j += 1

k += 1

while i < len(lefthalf):

alist[k] = lefthalf[i]

i += 1

k += 1

while j < len(righthalf):

alist[k] = righthalf[j]

j += 1

k += 1

alist = [54,26,93,17,77,31,44,55,20]

mergeSort(alist)

print(alist)