Introduction to Analysis of Algorithms and Data Structures
Introduction to Algorithms, 2nd Edition
Cormen, Leiserson, Rivest and Stein
courses :
Lecture # / topic(s)
- Course overview, Algorithm Design
- Data Structures Review, Graph Data Structures
- Data Structures continued, Insertion Sort
- Insertion Sort Correctness, Bubble Sort, Selection Sort.
- Mathematical review and Asymptotic analysis.
- Merge sort
- Recurrences and the Master Method
- The Master Method and Heaps
- Heapsort and Quicksort
- Quicksort and Minimum Comparison sorting complexity
- Counting sort, Radix sort, Bucket sort
- Hash Tables
- Hashing
- Binary Search Trees, Augmented Data Structures
- Binary Search Trees
- Midterm Review
- Midterm
- Greedy Algorithms
- Graph Traversal, Depth-first, Breadth-first
- Topological Sorting, cycle detection
- Minimum Spanning Trees
- Shortest Path, Dijkstra's Algorithm
- Final Review
click below to download :
![[ ]](http://www.cse.ohio-state.edu/icons/layout.gif){kind=icon}
![[ ]](http://www.cse.ohio-state.edu/icons/unknown.gif){kind=icon}
No comments:
Post a Comment