第05章基本技fundamentaltechniques.pptVIP

Chapter 5: Techniques Merge Sort Fundamental Techniques Outline and Reading The Greedy Method Technique (§5.1) Fractional Knapsack Problem (§5.1.1) Task Scheduling (§5.1.2) Divide-and-conquer paradigm (§5.2) Recurrence Equations (§5.2.1) Integer Multiplication (§5.2.2) Optional: Matrix Multiplication (§5.2.3) Dynamic Programming (§5.3) Matrix Chain-Product (§5.3.1) The General Technique (§5.3.2) 0-1 Knapsack Problem (§5.3.3) The Greedy Method Technique The greedy method is a general algorithm design paradigm, built on the following elements: configurations: different choices, collections,