forked from psounis/python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathexercise10.py
More file actions
50 lines (41 loc) · 1.18 KB
/
exercise10.py
File metadata and controls
50 lines (41 loc) · 1.18 KB
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
41
42
43
44
45
46
47
48
49
50
from random import randrange
def merge_sort(array):
def merge(array, start, finish):
C = []
middle = (start+finish)//2
i=start
n=middle
j=middle+1
m=finish
while i<=n and j<=m:
if array[i] < array[j]:
C += [array[i]]
i += 1
else:
C += [array[j]]
j +=1
if i == n+1:
C += array[j:m+1]
else:
C += array[i:n+1]
i = start
j = 0
while i<=finish:
array[i] = C[j]
i+=1
j+=1
def merge_sort_rec(array,start, finish):
if start == finish:
return
elif start == finish-1:
if array[start] > array[finish]:
array[start], array[finish] = array[finish], array[start]
else:
middle = (start+finish)//2
merge_sort_rec(array,start,middle)
merge_sort_rec(array,middle+1,finish)
merge(array,start,finish)
merge_sort_rec(array,0,len(array)-1)
ar = [randrange(100) for _ in range(50)]
merge_sort(ar)
print(ar)