PROBLEM SET
 

Problem 1. Find out the maximum and minimum numbers from a set of given numbers by using the divide and conquer strategy.

Problem 2. Sort a given array containing 'n' numbers using Divide and Conquer strategy.

Problem 3. Search for a number in a given list.

Problem 4. Explain the Strassen's Matrix Multiplication method based on Divide and Conquer method.

Non-profit Tax ID # 203478467