Closed Rohith1816 closed 1 month ago
please assign this issue to me
@Kumar-laxmi Sir ji please assign me this issue as I eagerly want to contribute to this issue under SSoC'23.
My approach will be:-
1. Implement the Node class to represent a node in the linked list. Each node should have a data attribute and a next attribute pointing to the next node.
2. Implement the QuickSortLinkedList class to perform Quick Sort on the linked list.
3. Define the push() method in QuickSortLinkedList class to insert a new node at the beginning of the linked list.
4. Implement the partition() method to choose a pivot element and partition the linked list around the pivot.
5. Implement the quickSortLinkedList() method to recursively perform Quick Sort on the linked list.
6. Implement the getTail() method to get the tail node of the linked list.
7. To use the QuickSortLinkedList class, create an instance, add nodes using the push() method, and then call the sort() method to perform Quick Sort on the linked list.
@Kumar-laxmi .Please assign this task to me under SSOC23
Stale issue message
Is your feature request related to a problem? Please describe. Quick Sort on Linked List is one of the important algorithm which is used to sort the Linked List in a particular pattren
Describe the solution you'd like I will make a function such that when we pass a head of the linked list to that function it return the pointer to the head after sorting the linked list
Additional context Please assign this task to me under SSOC23