Question

    What is the primary strategy of a divide-and-conquer

    algorithm?
    A Solve a problem by iteratively narrowing it down. Correct Answer Incorrect Answer
    B Solve a problem by recursively breaking it into smaller subproblems, solving the subproblems, and then combining their solutions. Correct Answer Incorrect Answer
    C Solve a problem by selecting the largest subproblem. Correct Answer Incorrect Answer
    D Solve a problem by trying all possible combinations of subproblems. Correct Answer Incorrect Answer

    Solution

    Solve a problem by recursively breaking it into smaller subproblems, solving the subproblems, and then combining their solutions.

    Practice Next
    More IT Networking Questions

    Relevant for Exams:

    ask-question