Javascript Program For QuickSort On Doubly Linked List

Last Updated : 03 May, 2023

Following is a typical recursive implementation of QuickSort for arrays. The implementation uses last element as pivot.

Javascript

<script>
/* A typical recursive implementation of
   Quicksort for array*/
   
/* This function takes last element as pivot,
   places the pivot element at its correct
   position in sorted array, and places all
   smaller (smaller than pivot) to left of
   pivot and all greater elements to right
   of pivot */
 
function partition (arr,l,h)
{
    let x = arr[h];
    let i = (l - 1);
      
    for(let j = l; j <= h - 1; j++)
    {
        if (arr[j] <= x)
        {
            i++;
            let tmp = arr[i];
            arr[i] = arr[j];
            arr[j] = tmp;
        }
    }   
    let tmp = arr[i + 1];
    arr[i + 1] = arr[h];
    arr[h] = tmp;
    return(i + 1);
}
 
/* A[] --> Array to be sorted,
    l  --> Starting index,
    h  --> Ending index */
function quickSort(A,l,h)
{
    if (l < h)
    {
        
        // Partitioning index
        let p = partition(A, l, h);
        quickSort(A, l, p - 1); 
        quickSort(A, p + 1, h);
    }
}
 
 
// This code is contributed by unknown2108
</script>

Can we use the same algorithm for Linked List?
Following is C++ implementation for the doubly linked list. The idea is simple, we first find out pointer to the last node. Once we have a pointer to the last node, we can recursively sort the linked list using pointers to first and last nodes of a linked list, similar to the above recursive function where we pass indexes of first and last array elements. The partition function for a linked list is also similar to partition for arrays. Instead of returning index of the pivot element, it returns a pointer to the pivot element. In the following implementation, quickSort() is just a wrapper function, the main recursive function is _quickSort() which is similar to quickSort() for array implementation.

Javascript

<script>
// A Javascript program to sort a linked list using Quicksort
let  head;
 
/* a node of the doubly linked list */
class Node
{
    constructor(d)
    {
        this.data = d;
        this.next = null;
        this.prev = null;
    }
}
 
// A utility function to find last node of linked list   
function lastNode(node)
{
    while(node.next != null)
            node = node.next;
        return node;
}
 
/* Considers last element as pivot, places the pivot element at its
   correct position in sorted array, and places all smaller (smaller than
   pivot) to left of pivot and all greater elements to right of pivot */
function partition(l, h)
{
 
    // set pivot as h element
        let x = h.data;
          
        // similar to i = l-1 for array implementation
        let i = l.prev;
          
        // Similar to "for (int j = l; j <= h- 1; j++)"
        for(let j=l; j!=h; j=j.next)
        {
            if(j.data <= x)
            {
                // Similar to i++ for array
                i = (i == null) ? l : i.next;
                let temp = i.data;
                i.data = j.data;
                j.data = temp;
            }
        }
        i = (i == null) ? l : i.next;  // Similar to i++
        let temp = i.data;
        i.data = h.data;
        h.data = temp;
        return i;
}
 
/* A recursive implementation of quicksort for linked list */
function _quickSort(l,h)
{
    if(h != null && l!=h && l != h.next){
            let temp = partition(l, h);
            _quickSort(l,temp.prev);
            _quickSort(temp.next,h);
        }
}
 
// The main function to sort a linked list. It mainly calls _quickSort()
function quickSort(node)
{
    // Find last node
        let head = lastNode(node);
          
        // Call the recursive QuickSort
        _quickSort(node,head);
}
 
// A utility function to print contents of arr
function printList(head)
{
    while(head!=null){
            document.write(head.data+" ");
            head = head.next;
        }
}
 
/* Function to insert a node at the beginning of the Doubly Linked List */
function push(new_Data)
{
    let new_Node = new Node(new_Data);     /* allocate node */
          
        // if head is null, head = new_Node
        if(head==null){
            head = new_Node;
            return;
        }
          
        /* link the old list of the new node */
        new_Node.next = head;
          
        /* change prev of head node to new node */
        head.prev = new_Node;
          
        /* since we are adding at the beginning, prev is always NULL */
        new_Node.prev = null;
          
        /* move the head to point to the new node */
        head = new_Node;
}
 
/* Driver program to test above function */
push(5);
push(20);
push(4);
push(3);
push(30);
 
 
document.write("Linked List before sorting <br>");
printList(head);
document.write("<br>Linked List after sorting<br>");
quickSort(head);
printList(head);
 
// This code is contributed by patel2127
</script>

Output :

Linked List before sorting
30  3  4  20  5
Linked List after sorting
3  4  5  20  30

Time Complexity: Time complexity of the above implementation is same as time complexity of QuickSort() for arrays. It takes O(n^2) time in the worst case and O(nLogn) in average and best cases. The worst case occurs when the linked list is already sorted.

Space Complexity: O(n). The extra space is due to the function call stack.

Can we implement random quicksort for a linked list?
Quicksort can be implemented for Linked List only when we can pick a fixed point as the pivot (like the last element in the above implementation). Random QuickSort cannot be efficiently implemented for Linked Lists by picking random pivot.

Please refer complete article on QuickSort on Doubly Linked List for more details!

Suggest improvement

Javascript Program For Reversing A Doubly Linked List

Share your thoughts in the comments