Back to Course


0% Complete
0/82 Steps
  1. Getting Started with Algorithm
    What is an Algorithm?
  2. Characteristics of Algorithm
    1 Topic
  3. Analysis Framework
  4. Performance Analysis
    3 Topics
  5. Mathematical Analysis
    2 Topics
  6. Sorting Algorithm
    Sorting Algorithm
    10 Topics
  7. Searching Algorithm
    6 Topics
  8. Fundamental of Data Structures
  9. Queues
  10. Graphs
  11. Trees
  12. Sets
  13. Dictionaries
  14. Divide and Conquer
    General Method
  15. Binary Search
  16. Recurrence Equation for Divide and Conquer
  17. Finding the Maximum and Minimum
  18. Merge Sort
  19. Quick Sort
  20. Stassen’s Matrix Multiplication
  21. Advantages and Disadvantages of Divide and Conquer
  22. Decrease and Conquer
    Insertion Sort
  23. Topological Sort
  24. Greedy Method
    General Method
  25. Coin Change Problem
  26. Knapsack Problem
  27. Job Sequencing with Deadlines
  28. Minimum Cost Spanning Trees
    2 Topics
  29. Single Source Shortest Paths
    1 Topic
  30. Optimal Tree Problem
    1 Topic
  31. Transform and Conquer Approach
    1 Topic
  32. Dynamic Programming
    General Method with Examples
  33. Multistage Graphs
  34. Transitive Closure
    1 Topic
  35. All Pairs Shortest Paths
    6 Topics
  36. Backtracking
    General Method
  37. N-Queens Problem
  38. Sum of Subsets problem
  39. Graph Coloring
  40. Hamiltonian Cycles
  41. Branch and Bound
    2 Topics
  42. 0/1 Knapsack problem
    2 Topics
  43. NP-Complete and NP-Hard Problems
    1 Topic
Lesson 6, Topic 6
In Progress

Quick Sort

Lesson Progress
0% Complete

Quicksort is an algorithm based on divide and conquer approach in which the array is split into subarrays and these sub-arrays are recursively called to sort the elements.

How QuickSort Works?

  1. A pivot element is chosen from the array. You can choose any element from the array as the pviot element.

    Here, we have taken the rightmost (ie. the last element) of the array as the pivot element.
KodNest 1 3

2.The elements smaller than the pivot element are put on the left and the elements greater than the pivot element are put on the right.

KodNest 2 1

The above arrangement is achieved by the following steps.

a. A pointer is fixed at the pivot element. The pivot element is compared with the elements beginning from the first index. If the element greater than the pivot element is reached, a second pointer is set for that element.

b. Now, the pivot element is compared with the other elements. If element smaller than the pivot element is reached, the smaller element is swapped with the greater element found earlier.

KodNest quick sort partition 1

c.The process goes on until the second last element is reached. 

d. Finally, the pivot element is swapped with the second pointer.

KodNest 4 1

3. Pivot elements are again chosen for the left and the right sub-parts separately. Within these sub-parts, the pivot elements are placed at their right position. Then, step 2 is repeated.

KodNest 5

4.The sub-parts are again divided into smallest sub-parts until each subpart is formed of a single element. 

5. At this point, the array is already sorted.

Quicksort uses recursion for sorting the sub-parts.

On the basis of Divide and conquer approach, quicksort algorithm can be explained as:

  • Divide
    The array is divided into subparts taking pivot as the partitioning point. The elements smaller than the pivot are placed to the left of the pivot and the elements greater than the pivot are placed to the right.
  • Conquer
    The left and the right subparts are again partitioned using the by selecting pivot elements for them. This can be achieved by recursively passing the subparts into the algorithm.
  • Combine
    This step does not play a significant role in quicksort. The array is already sorted at the end of the conquer step.

You can understand the working of quicksort with the help of an example/illustration below.

KodNest 6
KodNest 7

Quick Sort Algorithm

quickSort(array, leftmostIndex, rightmostIndex)
  if (leftmostIndex < rightmostIndex)
    pivotIndex <- partition(array,leftmostIndex, rightmostIndex)
    quickSort(array, leftmostIndex, pivotIndex)
    quickSort(array, pivotIndex + 1, rightmostIndex)
partition(array, leftmostIndex, rightmostIndex)
  set rightmostIndex as pivotIndex
  storeIndex <- leftmostIndex - 1
  for i <- leftmostIndex + 1 to rightmostIndex
    if element[i] < pivotElement
      swap element[i] and element[storeIndex]
  swap pivotElement and element[storeIndex+1]
return storeIndex + 1

Quick Sort Program in C

// Quick sort in C
#include <stdio.h>
void swap(int *a, int *b)
  int t = *a;
  *a = *b;
  *b = t;
int partition(int array[], int low, int high)
  int pivot = array[high];
  int i = (low - 1);
  for (int j = low; j < high; j++)
    if (array[j] <= pivot)
      swap(&array[i], &array[j]);
  swap(&array[i + 1], &array[high]);
  return (i + 1);
void quickSort(int array[], int low, int high)
  if (low < high)
    int pi = partition(array, low, high);
    quickSort(array, low, pi - 1);
    quickSort(array, pi + 1, high);
void printArray(int array[], int size)
  for (int i = 0; i < size; ++i)
    printf("%d  ", array[i]);
int main()
  int data[] = {8, 7, 2, 1, 0, 9, 6};
  int n = sizeof(data) / sizeof(data[0]);
  quickSort(data, 0, n - 1);
  printf("Sorted array in ascending order: \n");
  printArray(data, n);


Time Complexities

  • Worst Case Complexity [Big-O]O(n2)

    It occurs when the pivot element picked is always either the greatest or the smallest element.

    In the above algorithm, if the array is in descending order, the partition algorithm always picks the smallest element as a pivot element.
  • Best Case Complexity [Big-omega]O(n*log n)

    It occurs when the pivot element is always the middle element or near to the middle element.
  • Average Case Complexity [Big-theta]O(n*log n)

    It occurs when the above conditions do not occur.

Space Complexity

The space complexity for quicksort is O(n*log n).

Quicksort Applications

Quicksort is implemented when

  • the programming language is good for recursion
  • time complexity matters
  • space complexity matters

New Report