-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathmergesort.py
More file actions
40 lines (29 loc) · 793 Bytes
/
mergesort.py
File metadata and controls
40 lines (29 loc) · 793 Bytes
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
32
33
34
35
36
37
38
39
40
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=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
alist = [4,2,9,4,1,0,23,5]
mergesort(alist)
print(alist)