Q.

What is an in-place sorting algorithm?

A. It needs O(1) or O(logn) memory to create auxiliary locations
B. The input is already sorted and in-place
C. It requires additional storage
D. It requires additional space
Answer» A. It needs O(1) or O(logn) memory to create auxiliary locations
710
0
Do you find this helpful?
1

View all MCQs in

Data Structures (DS)

Discussion

No comments yet

Related MCQs