In-place sorting algorithms have what space complexity?

Question

Accepted Answer

(C) O(1). Explanation: In-place sorting uses a constant amount of extra space → O(1).