fork download
  1. def merge(L, nL, R, nR, A):
  2. pass
  3.  
  4. def mergeSort(A, n):
  5. if n <= 1:
  6. return
  7. nL = n//2
  8. nR = n - nL
  9. L = A[:nL]
  10. R = A[nL:n]
  11. mergeSort(L, nL)
  12. mergeSort(R, nR)
  13. merge(L, nL, R, nR, A)
Success #stdin #stdout 0.05s 63648KB
stdin
Standard input is empty
stdout
Standard output is empty