Merge Sort, Merge Sort Algorithm, Data Structures, Data Structure Algorithm, Naem Azam.
else: arr[k] = rightArray[j] j += 1 k += 1 while i < len(leftArray): arr[k] = leftArray[i] i += 1 k += 1 while j < len(rightArray): arr[k] = rightArray[j] j += 1 k += 1 #function to print the array def display(arr): for i in range(len(arr)): print(arr[i], end=" ") print() #driver code if __name__