1. In computer science, divide and conquer is an algorithm design paradigm based on multi-branched __________

2. Divide and conquer algorithms are said to solve problems by doing which of the following?

3. A divide-and-conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become _____________________

4. This divide-and-conquer technique is the basis of efficient algorithms for all kinds of problems, including:

5. Fill in the blanks for the following excerpt.

6. An important application of divide and conquer is in ____________________.

7. Divide-and-conquer algorithms naturally tend to make efficient use of memory caches

8. Divide-and-conquer algorithms can also be implemented by a non-recursive program that stores the partial sub-problems in some explicit data structure, such as a ______________.

9. In _____________ implementations of D&C algorithms, one must make sure that there is sufficient memory allocated for the stack.

10. Recursion gives us the ability to branch while iterating , known as the â€˜divide and conquerâ€™ technique used
in algorithms like ____________.