As we know quick sort is the practical sorting algorithm, It is in-palace sorting algorithm (i.e. It does not require external memory for the sorting operation). Minimum time taken by the quick sort algorithm is N( log N ) which also known as best case time complexity. Its performance is worst when the array contain sorted element in this case it take N square time . Now my question is what is the algorithm for quick sort?