4.1. Divide-and-Conquer Definition4.2. Example Application 1: Most Valuable Subsequence4.3. Example Application 2: Binary Search4.4. Time Complexity of Binary Search4.5. False “Divide-and-Conquer”4.6. Maximum Sublist Example: An Alternative Algorithm4.7. Time Complexity of the Maximum Sublist AlgorithmSummary