Created
May 17, 2012 18:16
-
-
Save jogi/2720700 to your computer and use it in GitHub Desktop.
Recursive Mergesort in Python
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def merge(left, right): | |
if not len(left) or not len(right): | |
return left or right | |
result = [] | |
i, j = 0, 0 | |
while (len(result) < len(left) + len(right)): | |
if left[i] < right[j]: | |
result.append(left[i]) | |
i+= 1 | |
else: | |
result.append(right[j]) | |
j+= 1 | |
if i == len(left) or j == len(right): | |
result.extend(left[i:] or right[j:]) | |
break | |
return result | |
def mergesort(list): | |
if len(list) < 2: | |
return list | |
middle = len(list)/2 | |
left = mergesort(list[:middle]) | |
right = mergesort(list[middle:]) | |
return merge(left, right) | |
if __name__ == "__main__": | |
print mergesort([3,4,5,1,2,8,3,7,6]) |
Here is merge sort in one function with detailed information on running process
def merge_sort(nlist):
print("Splitting ", nlist)
if len(nlist) > 1:
mid = len(nlist) // 2
lefthalf = nlist[:mid]
righthalf = nlist[mid:]
merge_sort(lefthalf)
merge_sort(righthalf)
i = j = k = 0
while i < len(lefthalf) and j < len(righthalf):
if lefthalf[i] < righthalf[j]:
nlist[k] = lefthalf[i]
i = i + 1
else:
nlist[k] = righthalf[j]
j = j + 1
k = k + 1
while i < len(lefthalf):
nlist[k] = lefthalf[i]
i = i + 1
k = k + 1
while j < len(righthalf):
nlist[k] = righthalf[j]
j = j + 1
k = k + 1
print("Merging ", nlist)
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Thank you for this piece of code)
By the way, if someone find it interesting, here is merge realisation with deque from python collections: