Why does the recursive implementation of quicksort require O(log n) of additional space?

The recursive implementation of quicksort requires O(log n) of additional space because it uses the call stack to keep track of subarrays being sorted. Each recursive call adds a new frame to the call stack, and the maximum depth of the call stack is O(log n) in the average case.