Q231
What is an in-place sorting algorithm?
A.
It needs O(1) or O(logn) memory to create auxiliary locations
AnswerB.
The input is already sorted and in-place
C.
It requires additional storage
D.
It requires additional space
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board