A

Admin • 833.24K Points
Coach

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.

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.