Quick sort is an efficient sorting algorithm. It is even two or three times faster than mergesort and heapsort in some particular cases. The sorting method compares n items in O(nlogn) time in average and best cases, while it is O(n^2) in worst case. Quick sort comes under divide and conquer algorithm which divides the large set of array in small by picking up a pivot element as a reference element, and do sorting. Algorithm: (1) Make a list of items that need to be sorted, let’s apply in an array. (2) Choose a suitable element as pivot element from the array list, because complexity largely depends on choosing the pivot element. (3) Rearrange the array list so that all the elements with value less than the pivot will come before the pivot and the element with value greater will come after the pivot with in the same array, which make pivot element in the sorted position. (4) Apply recursively the third step to the sub array of the element with smaller values and separ