ppt课件-analysisofalgorithms-hiramcollege.pptVIP

Merge Sort Chapter 5 Fundamental Techniques Acknowledges In addition to the textbook slides and my slides, I used some from Dr. Ying Lu of University of Nebraska at Lincoln, especially on dynamic programming solution of the 0/1 Knapsack Problem. We’ll look at 3 very fundamental design paradigms: Greedy method Often used in problems involving weighted graphs data compression problems Divide and conquer method Already seen this is merge-sort and quick-sort Here we’ll concentrate on the analyzing of problems solved by this method by solving recurrence relations Dynamic programming Very powerful