A

Admin • 833K Points
Coach

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

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

Explanation by: Admin

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

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.