Q. The correctness of a divide and conquer algorithm is usually proved by _________. (Solved)
1. mathematical theorem.
2. de-Morgan `s law.
3. mathematical induction.
4. none.
- c. mathematical induction.
1. mathematical theorem.
2. de-Morgan `s law.
3. mathematical induction.
4. none.