Divide and Conquer is an algorithmic paradigm that solves problems by:

Bihar STET · PGT (Paper 2) · Computer Science · 2025

1. A.

   Iteratively solving subproblems

2. B.

   Recursively solving subproblems

3. C.

   Using heuristics to find solutions

4. D.

   Greedily combining solutions

Attempted by 64 students.

The worked solution is available to enrolled students.