Divide and Conquer

Consider the following problem: Given a unimodal sequence of distinct integers, find the PEAK (the maximum element). This problem sounds like...

binary search

Some divide and conquer algorithms look like ____ ____ where most of the work is done by dividing up the problem

binary search

A divide and conquer algorithm ____ ____ ____ into one **** for the original problem.

combines smaller solutions

Some divide and conquer algorithms look like merge sort where most of the work is done by ____ ____ ____

combining the solutions

A ____ ____ ____ algorithm combines smaller solutions into one solution for the original problem.

divide and conquer

A ____ ____ ____ algorithm solves subproblems by obtaining smaller solutions

divide and conquer

A ____ ____ ____ algorithm splits a problem into smaller instances of the same problem.

divide and conquer

Some divide and conquer algorithms look like binary search where most of the work is done by ____ ____ ____ ____

dividing up the problem

Some divide and conquer algorithms look like ____ ____ where most of the work is done by combining the solutions

merge sort

The divide and conquer approach implies ____

recursion

A divide and conquer algorithm ____ ____ by obtaining ____ ____

solves subproblems, smaller solutions

A divide and conquer algorithm ____ ____ ____ into smaller instances of the same ****.

splits a problem