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

💬 Discuss

✅ Correct Answer: (A) It needs O(1) or O(logn) memory to create auxiliary locations

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:19 pm in Data Structure (DS)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

544

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate