Space and time complexity of Quick Sort

Why we are not taking an extra array in space complexity?

In quick sort, we don’t use any extra array. We do in-place sorting using pivot function. So the space complexity is O(1).

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.