Q. What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?

(A) o(n)
(B) o(1)
(C) o(n!)
(D) o(n2)

💬 Discuss

✅ Correct Answer: (B) o(1)

Explanation: the divide and conquer algorithm uses a constant space. so, the space complexity is o(1).

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

the divide and conquer algorithm uses a constant space. so, the space complexity is o(1).

💬 Discussion

📊 Question Analytics

👁️

360

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

88%

Success Rate