Quick Sort in C [Program & Algorithm]

By | February 19, 2014
In this tutorial you will learn about algorithm and program for quick sort in C.


Quick sort is the fastest internal sorting algorithm with the time complexity O (n log n). The basic algorithm to sort an array a[ ] of n elements can be described recursively as follows:


Quick Sort Algorithm

1. If n < = 1, then return.


2. Pick any element V in a[]. This is called the pivot.
3. Rearrange elements of the array by moving all elements xi > V right of V and all elements x­i < = V left of V. If the place of the V after re-arrangement is j, all elements with value less than V, appear in a[0], a[1] . . . . a[j – 1] and all those with value greater than V appear in a[j + 1] . . . . a[n – 1].
4. Apply quick sort recursively to a[0] . . . . a[j – 1] and to a[j + 1] . . . . a[n – 1].

Quick Sort Animation

Quick Sort Animation, Quick Sort in C
Quick Sort Animation, Quick Sort in C
Visualization of the quicksort algorithm. The horizontal lines are pivot values.


Quick Sort Program in C


What is Quick Sort? Algorithm and C Program to Implement Quick Sort
If you found anything incorrect or have any doubts regarding above quick sort in C tutorial then comment below.

Leave a Reply

Your email address will not be published. Required fields are marked *