└── merge sort


/merge sort:
--------------------------------------------------------------------------------
 1 | def ms(a):
 2 |     print(a)
 3 |     if len(a)>1:
 4 |        mid=len(a)//2
 5 |        lhalf=a[:mid]
 6 |        rhalf=a[mid:]
 7 |        ms(lhalf)
 8 |        ms(rhalf)
 9 |        i=0
10 |        j=0
11 |        k=0
12 |        while i<len(lhalf) and j<len(rhalf):
13 |          if lhalf[i]<rhalf[j]:
14 |             a[k]=lhalf[i]
15 |          i=i+1
16 |     else:
17 |        a[k]=rhalf[j]
18 |        j=j+1
19 |        k=k+1
20 |        while i<len(lhalf):
21 |          a[k]=lhalf[i]
22 |          i=i+1
23 |          k=k+1
24 |          while j<len(rhalf):
25 |            a[k]=rhalf[j]
26 |            j=j+1
27 |            k=k+1
28 | a=[14,8,9,5,814,1408,978]
29 | print(a)
30 | ms(a)
31 | print(a)
32 | 


--------------------------------------------------------------------------------