Q. What is an in-place sorting algorithm? (Solved)
1. It needs O(1) or O(logn) memory to create auxiliary locations
2. The input is already sorted and in-place
3. It requires additional storage
4. It requires additional space
- a. It needs O(1) or O(logn) memory to create auxiliary locations