The correctness of a divide and conquer algorithm is usually proved by _________.

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure (DS)

Q. The correctness of a divide and conquer algorithm is usually proved by _________.

(A) mathematical theorem.
(B) de-Morgan `s law.
(C) mathematical induction.
(D) none.

💬 Discuss

✅ Correct Answer: (C) mathematical induction.

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

1002

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate