Summary of the maximum minimum value------the divide-and-conquer algorithm

1. What is a divide-and-conquer algorithm:

When a big problem is not intuitive or even very difficult to solve, you can consider the big problem into a small problem, when the small problem is still difficult to solve directly, the small problem continues to transform into a smaller problem, until you can directly solve the problem.

2. Maximum minimum use divide and conquer the method to solve the idea:

Need to discuss: a. If the length of the array is only 1 or 2, the maximum minimum value is calculated directly compared.

B. If the length of the array is greater than 2, the direct solution seems a bit difficult, then, you can divide the array from the middle into a two part, if the length of a, B is still greater than 2, you need to continue to divide the array, until the length is less than or equal to 2. can be directly compared with step a method.

The following content for my own review, I feel this is more suitable for me.

I use the example myself, array={11,55,88,4,67,131,93,66};

The results of the output are as follows:

Happy, finally finished!

Summary of the maximum minimum value------the divide-and-conquer algorithm