FilesExpand file tree

 master

/

main.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

56 lines (39 loc) · 1.09 KB

 master

/

main.py

Copy path

Top

File metadata and controls

• Code
• Blame

56 lines (39 loc) · 1.09 KB

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

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

from merge_sort import MergeSort

def is_sorted(numbers):

last_num = float("-inf")

in_order = True

for n in numbers:

if n < last_num:

in_order = False

break

last_num = n

return in_order

def contain_same_ints(arr1, arr2):

for i in arr1:

found = False

for j in arr2:

if i == j:

found = True

break

if not found:

return False

return True

def main():

original = [325432, 989, 547510, 3, -93, 189019, 5042, 123,

597, 42, 7506, 184, 184, 2409, 45, 824,

4, -2650, 9, 662, 3928, -170, 45358, 395,

842, 7697, 110, 14, 99, 221]

numbers = original[:]

ms = MergeSort(numbers)

output = ms.sort()

if is_sorted(output):

print("** SUCCESS! **")

else:

print("Uh oh - not in order.")

if contain_same_ints(original, numbers):

print("** Contain the same elements! **")

else:

print("Uh oh - something is missing.")

print(output)

if __name__ == "__main__":

main()