Section 18.8 Check Point Questions3 questions
18.8.1
What is the divide-and-conquer approach? Give an example.
18.8.2
What is the difference between divide-and-conquer and dynamic programming?
18.8.3
Can you design an algorithm for finding the minimum element in a list using divide-and-conquer? What is the complexity of this algorithm?