Call Tree

Let's illustrate the call tree for finding the median:

Initial Call:

Array:

Pivot:

Partitioned:

Pivot position:

$(0-$based index$)$

Recursive Call on Left Subarray:

Array:

Pivot:

Partitioned:

Pivot position:

Recursive Call on Right Subarray:

Array:

Pivot:

Partitioned:

Pivot position:

Recursive Call on Left Subarray:

Array:

Pivot:

Partitioned:

Pivot position:

Recursive Call on Left Subarray:

Array:

Pivot:

Partitioned:

Pivot position:

The pivot

is now at the $7$th position $(0-$based index$),$ which is the $8$th smallest element in the array. Therefore, the median is

$.$

Conclusion

The median of the array

is

$.$