QuickSort on Doubly Linked List

QuickSort on Doubly Linked List is a sorting algorithm that uses the divide and conquer approach. It is a very efficient algorithm and is based on the partitioning of the array elements. The basic idea is to consider one element as pivot and partition the array around it such that: Left side of pivot contains all the elements that are less than the pivot element Right side contains all elements greater than the pivot QuickSort on Doubly Linked List is an in-place sorting algorithm. It does not require any extra space.