Description: Algorithm analysis and design of the lecture content of dynamic programming, sub-system thinking, greedy algorithm
To Search:
File list (Check if you may need any files):
Let7-Sorting in linear time 2.ppt
Let8-Medians and Order Statistics.ppt
Let9-Dynamic Programming 1.ppt
Let9-Dynamic Programming 2.ppt
Let10-Greedy Algorithms.ppt
Let11-Shortest Paths I.ppt
Let12-Shortest Paths II.ppt
Let13-Shortest Paths III.ppt
Let14-Back Tracking Algorithms I.ppt
Let15-Back Tracking Algorithms II.ppt
Let16-Back Tracking Algorithms III.ppt
Let17-Branch and Bound Algorithms.ppt
Let18-NP.ppt
Review.ppt
Let1-introduction.ppt
Let2-Getting Started.ppt
Let3-Growth of Functions.ppt
Let4-Recurrences.ppt
Let5-Heap Sort.ppt
Let6-Quick Sort.ppt
Let7-Sorting in linear time 1.ppt