The task is to complete merge() function which is used to implement Merge Sort.
Input:
First line of the input denotes number of test cases 'T'. First line of the testcase is the size of array and second line consists of array elements separated by space.
Output:
Sorted array in increasing order is displayed to the user.
User Task:
You don't need to take the input or print anything. Your task is to complete the function merge() which takes the array arr[], the starting position of the first array (l), the ending position of the first array (m) and the ending position of the second array (r) as its inputs and modifies the array arr[] such that it is sorted from position l to position r.
Expected Auxiliary Space: O(n)
Expected Time Complexity: O(n) (for the merge() function)
Constraints:
1 <= T <= 50
1 <= N <= 105
1 <= arr[i] <= 103
Example:
Input:
2
5
4 1 3 9 7
10
10 9 8 7 6 5 4 3 2 1
Output:
1 3 4 7 9
1 2 3 4 5 6 7 8 9 10
Explanation:
Testcase 1: The array after performing mergesort is: 1 3 4 7 9.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| sudhanmadhu7981 | 631 |
| RudraKaniya | 624 |
| ishaanprajapati808 | 620 |
| saxenadivyanshi004 | 572 |
| AmanSharma44 | 563 |
| sudhanmadhu7981 | 631 |
| RudraKaniya | 629 |
| ishaanprajapati808 | 620 |
| saxenadivyanshi004 | 572 |
| AmanSharma44 | 563 |
| blackshadows | 5362 |
| Ibrahim Nash | 5244 |
| akhayrutdinov | 5111 |
| mb1973 | 4976 |
| Quandray | 4736 |