To implement the quicksort algorithm, various rules of choosing the pivot can be used.
The partition operation can also be implemented in many ways.
Suppose you have the following array:
{ 12, 3, 7, 55, 27, 18, 44, 2 }Match the selection pivot and a possible result of the partition operation.