A

Admin • 832.70K Points
Coach

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)

Explanation by: Admin

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

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.