quick sort quick sort is highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays large array is partitioned into two arrays one of which holds values smaller than the specified valuesay pivotbased on which the partition is made and another array holds values greater than the pivot value quick sort partitions an array and then calls itself recursively twice to sort the two resulting subarrays this algorithm is quite efficient for large-sized data sets as its average and worst case complexity are of ( )where is the number of items partition in quick sort following animated representation explains how to find the pivot value in an array the pivot value divides the list into two parts and recursivelywe find the pivot for each sub-lists until all lists contains only one element quick sort pivot algorithm based on our understanding of partitioning in quick sortwe will now try to write an algorithm for itwhich is as follows step choose the highest index value has pivot step take two variables to point left and right of the list excluding pivot step left points to the low index step right points to the high step while value at left is less than pivot move right step while value at right is greater than pivot move left step if both step and step does not match swap left and right step if left >rightthe point where they met is new pivot quick sort pivot pseudocode the pseudocode for the above algorithm can be derived as function partitionfunc(leftrightpivotleftpointer left rightpointer right while true do while [++leftpointerpivot do