end while while rightpointer & [--rightpointerpivot do //do-nothing end while if leftpointer >rightpointer break else swap leftpointer,rightpointer end if end while swap leftpointer,right return leftpointer end function quick sort algorithm using pivot algorithm recursivelywe end up with smaller possible partitions each partition is then processed for quick sort we define recursive algorithm for quicksort as follows step make the right-most index value pivot step partition the array using pivot value step quicksort left partition recursively step quicksort right partition recursively quick sort pseudocode to get more into itlet see the pseudocode for quick sort algorithm procedure quicksort(leftrightif right-left < return else pivot [rightpartition partitionfunc(leftrightpivotquicksort(left,partition- quicksort(partition+ ,rightend if end procedure