FilesExpand file tree

 master

/

mergesort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

33 lines (26 loc) · 590 Bytes

 master

/

mergesort.py

Copy path

Top

File metadata and controls

• Code
• Blame

33 lines (26 loc) · 590 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

32

33

def merge(A, B):

C = []

i, j = 0, 0

while i < len(A) and j < len(B):

if A[i] <= B[j]:

C.append(A[i])

i += 1

else:

C.append(B[j])

j += 1

if i < len(A):

C += A[i:]

if j < len(B):

C += B[j:]

return C

def mergsort(A):

n = len(A)

if n < 2:

return A[:]

left = mergsort(A[:n // 2])

right = mergsort(A[n // 2:])

return merge(left, right)

if __name__ == '__main__':

a = [7, 6, 8, 5, 2, 1, 3, 4, 0, 9, 10]

print(a)

print(mergsort(a))