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)

💬 Discuss

✅ Correct Answer: (D) o(2n)

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

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

Explanation by: Mr. Dubey

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

💬 Discussion

📊 Question Analytics

👁️

504

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

84%

Success Rate