blob: e7d7011609a95cc9e38b2fea7c73885e3912bb57 (
plain) (
blame)
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
# Python program for implementation of MergeSort
# https://www.geeksforgeeks.org/merge-sort/
import random
def mergeSort(arr):
if len(arr) > 1:
# Finding the mid of the array
mid = len(arr)//2
# Dividing the array elements
L = arr[:mid]
# into 2 halves
R = arr[mid:]
# Sorting the first half
mergeSort(L)
# Sorting the second half
mergeSort(R)
i = j = k = 0
# Copy data to temp arrays L[] and R[]
while i < len(L) and j < len(R):
if L[i] < R[j]:
arr[k] = L[i]
i += 1
else:
arr[k] = R[j]
j += 1
k += 1
# Checking if any element was left
while i < len(L):
arr[k] = L[i]
i += 1
k += 1
while j < len(R):
arr[k] = R[j]
j += 1
k += 1
def mkRandList ( n ):
a=[]
for i in range(1,n+1):
a.insert(0, random.randint(0,10000))
return a
def validation(alist):
for i in range(len(alist)-1):
if (alist[i] > alist[i+1]):
return False
return True
a = mkRandList(260000)
mergeSort(a)
print(validation(a))
|
