Quick Sort on Linked List
Submissions: 1121   Accuracy:

62.9%

  Difficulty: Medium   Marks: 4

Sort the given Linked List using quicksort. which takes O(n^2) time in worst case and O(nLogn) in average and best cases, otherwise you may get TLE.
 

Input:

In this problem, method takes 1 argument: address of the head of the linked list. The function should not read any input from stdin/console.
The struct Node has a data part which stores the data and a next pointer which points to the next element of the linked list.
There are multiple test cases. For each test case, this method will be called individually.


Output:

Set *headRef to head of resultant linked list.

Constraints:

1<=T<=100

1<=N<=200


Note: If you use "Test" or "Expected Output Button" use below example format

Example:

Input
2
3
1 6 2
4
1 9 3 8

Output

1 2 6
1 3 8 9

 

** For More Input/Output Examples Use 'Expected Output' option **

Author: bhawnamait


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.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.