Q. What is an in-place sorting algorithm?

• It needs O(1) or O(logn) memory to create auxiliary locations
• The input is already sorted and in-place
• It requires additional storage
• It requires additional space

Submit