Sort the following array a using quicksort,
[6, 11, 4, 9, 8, 2, 5, 8, 13, 7]
The pivot should be chosen as the arithmetic mean of the first
The position of the pivot from that calculation is not important, quicksort sorts the elements based on whether they are more or less than the pivot. Then the pivot is placed in between the two sets (more and less).