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:
Since this is a functional problem you don't have to worry about input, you just have to complete the function merge().
Constraints:
1 <= T <= 50
1 <= N <= 103
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.
| codersanjeev | 66 |
| snow_den_ | 60 |
| BoggavarapuRamSaranSaiSrinivasGupta | 60 |
| rajupraaa1234 | 53 |
| SUZAKU | 49 |
| mr_kksparrow | 433 |
| manvirag982 | 258 |
| snow_den_ | 232 |
| arpit_anshuman | 228 |
| SoumyaKaushik | 205 |
| blackshadows | 5331 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4567 |