Q. What is the time complexity of Kadane’s algorithm?

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

💬 Discuss

✅ Correct Answer: (B) o(n)

Explanation: the time complexity of kadane’s algorithm is o(n) because there is only one for loop which scans the entire array exactly once.

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 time complexity of kadane’s algorithm is o(n) because there is only one for loop which scans the entire array exactly once.

💬 Discussion

📊 Question Analytics

👁️

1025

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

89%

Success Rate