Quick Sort in C

Quick sort is a fastest sorting algorithm, which use divide and conquer method to sort a list of data. It divide the array of items into two partitions and then call the sorting procedure recursively to sort the two partitions.


Click here for quick sort example in C