Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def merge_sort(arr):
- if len(arr) > 1:
- mid = len(arr) // 2
- L = arr[:mid]
- R = arr[mid:]
- merge_sort(L)
- merge_sort(R)
- i = j = k = 0
- 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
- while i < len(L):
- arr[k] = L[i]
- i += 1
- k += 1
- while j < len(R):
- arr[k] = R[j]
- j += 1
- k += 1
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement