A

Admin • 833K Points
Coach

Q. What is the time complexity of the brute force algorithm used to find the longest common subsequence?

  • (A) o(n)
  • (B) o(n2)
  • (C) o(n3)
  • (D) o(2n)

Explanation by: Admin

the time complexity of the brute force algorithm used to find the longest common subsequence is o(2n).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.