Given Pointer/Reference to the head of the linked list, the task is to Sort the given linked list using Merge Sort.
Note: If the length of linked list is odd, then the extra node should go in the first list while splitting.
Example 1:
Input:
N = 5
value[] = {3,5,2,4,1}
Output: 1 2 3 4 5
Explanation: After sorting the given
linked list, the resultant matrix
will be 1->2->3->4->5.
Example 2:
Input:
N = 3
value[] = {9,15,0}
Output: 0 9 15
Explanation: After sorting the given
linked list , resultant will be
0->9->15.
Your Task:
For C++ and Python: The task is to complete the function mergeSort() which sort the linked list using merge sort function.
For Java: The task is to complete the function mergeSort() and return the node which can be used to print the sorted linked list.
Expected Time Complexity: O(N*Log(N))
Expected Auxiliary Space: O(1)
Constraints:
1 <= T <= 100
1 <= N <= 105
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.
| Umakant_Dubey | 314 |
| binod_gotiyo | 307 |
| lone_walker | 304 |
| NaveenGarg2 | 235 |
| ArpitGupta8 | 233 |
| saiujwal13083 | 799 |
| ppsvikhyat17 | 712 |
| generic_coder | 630 |
| lone_walker | 590 |
| NaveenGarg2 | 554 |
| blackshadows | 5448 |
| Ibrahim Nash | 5438 |
| akhayrutdinov | 5111 |
| mb1973 | 4976 |
| Quandray | 4752 |