# C program for Quick Sort

C program for Quick Sort. Quick Sort also known as Partition exchange sort, is a comparison unstable -in-place sorting algorithm. Quick Sort compare n items in O(nlogn) time complexity in average and best case, while takes O(n2) in worst case. It comes under divide and conquer algorithm which divides the large set of array in small … Continue reading C program for Quick Sort