Problem
Given an array with 23 elements, we want to apply the quicksort on it. If we know that the pivot for the first partition happens to be the 13-th smallest element, find the maximum possible number of swap operations that you need for the partition step. (Include the final swap operation to put the pivot in place.)