| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 26 |
23. Computational Complexity (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 27 |
R20. Dynamic Programming: Blackjack (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 28 |
24. Topics in Algorithms Research (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 29 |
R21. Dynamic Programming: Knapsack Problem (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 30 |
3. Insertion Sort, Merge Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 31 |
R22. Dynamic Programming: Dance Dance Revolution (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 32 |
4. Heaps and Heap Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 33 |
R23. Computational Complexity (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 34 |
5. Binary Search Trees, BST Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 35 |
6. AVL Trees, AVL Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 36 |
R24. Final Exam Review (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 37 |
R3. Document Distance, Insertion and Merge Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 38 |
7. Counting Sort, Radix Sort, Lower Bounds for Sorting (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 39 |
R5. Recursion Trees, Binary Search Trees (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 40 |
8. Hashing with Chaining (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 41 |
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 42 |
9. Table Doubling, Karp-Rabin (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 43 |
R7. Comparison Sort, Counting and Radix Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 44 |
R1. Asymptotic Complexity, Peak Finding (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 45 |
R8. Simulation Algorithms (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 46 |
R9. Rolling Hashes, Amortized Analysis (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 47 |
Recitation 9b: DNA Sequence Matching (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
