Merge pull request #127 from vaishnavii15/patch-1

Merge Sort code in Python

Author: BeeBombshell

Merge Sort

@@ -0,0 +1,50 @@
+#Merge Sort python code
+
+def mergeSort(arr):
+ if len(arr) > 1:
+ mid = len(arr)//2
+ left = arr[:mid]
+ right = arr[mid:]
+ mergeSort(left)
+ mergeSort(right)
+ 
+ i = j = k = 0
+ 
+ # Copy data to temporary arrays left and right
+ while i < len(left) and j < len(right):
+ if left[i] <= right[j]:
+ arr[k] = left[i]
+ i += 1
+ else:
+ arr[k] = right[j]
+ j += 1
+ k += 1
+ 
+ # Checking if any element was left in array
+ while i < len(left):
+ arr[k] = left[i]
+ i += 1
+ k += 1
+ 
+ while j < len(right):
+ arr[k] = right[j]
+ j += 1
+ k += 1
+ 
+ 
+ 
+# Code to print the list
+def printList(arr):
+ for i in range(len(arr)):
+ print(arr[i], end=" ")
+ print()
+ 
+ 
+# Driver Code
+if __name__ == '__main__':
+ arr = [int(i) for i in input().split()]
+ print("Given array is", end="\n")
+ printList(arr)
+ mergeSort(arr)
+ print("Sorted array is: ", end="\n")
+ printList(arr)