Skip to content

Tag Archives: Linked-List-Sorting

Given a linked list, apply the Quick sort algorithm to sort the linked list. The important things about implementation are, that it changes pointers rather… Read More
Following is a typical recursive implementation of QuickSort for arrays. The implementation uses last element as pivot.  C++ /* A typical recursive implementation of Quicksort… Read More
Given a linked list of 0s, 1s and 2s, The task is to sort and print it. Examples:  Input: 1 -> 1 -> 2 ->… Read More
  Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes some other algorithms (such as… Read More

Start Your Coding Journey Now!