|
47 vidéos trouvées. |
|
| | durée | vues | |
| 11. Integer Arithmetic, Karatsuba Multiplication | 47:24 | 0 | |
| 9. Table Doubling, Karp-Rabin | 52:47 | 0 | |
| 5. Binary Search Trees, BST Sort | 52:40 | 0 | |
| 7. Counting Sort, Radix Sort, Lower Bounds for Sorting | 52:90 | 0 | |
| 4. Heaps and Heap Sort | 52:32 | 0 | |
| 6. AVL Trees, AVL Sort | 51:59 | 0 | |
| 3. Insertion Sort, Merge Sort | 51:20 | 0 | |
| 2. Models of Computation, Document Distance | 48:52 | 0 | |
| 12. Square Roots, Newton's Method | 51:17 | 0 | |
| 14. Depth-First Search (DFS), Topological Sort | 50:31 | 0 | |
| 24. Topics in Algorithms Research | 46:46 | 0 | |
| 23. Computational Complexity | 51:12 | 0 | |
| 16. Dijkstra | 51:26 | 0 | |
| 19. Dynamic Programming I: Fibonacci, Shortest Paths | 51:47 | 0 | |
| 18. Speeding up Dijkstra | 53:16 | 0 | |
| 1. Algorithmic Thinking, Peak Finding | 53:22 | 0 | |
| 15. Single-Source Shortest Paths Problem | 53:15 | 0 | |
| Recitation 9b: DNA Sequence Matching | 57:28 | 0 | |
| R24. Final Exam Review | 51:44 | 0 | |
| R21. Dynamic Programming: Knapsack Problem | 1:09:12 | 0 | |
| R23. Computational Complexity | 47:14 | 0 | |
| R19. Dynamic Programming: Crazy Eights, Shortest Path | 52:47 | 0 | |
| R16. Rubik's Cube, StarCraft Zero | 54:36 | 0 | |
| R15. Shortest Paths | 56:31 | 0 | |
| 8. Hashing with Chaining | 51:16 | 0 | |
| 20. Dynamic Programming II: Text Justification, Blackjack | 52:12 | 0 | |
| 10. Open Addressing, Cryptographic Hashing | 50:55 | 0 | |
| 13. Breadth-First Search (BFS) | 50:48 | 0 | |
| 21. DP III: Parenthesization, Edit Distance, Knapsack | 52:41 | 0 | |
| 22. DP IV: Guitar Fingering, Tetris, Super Mario Bros. | 49:20 | 0 | |
| 17. Bellman-Ford | 48:51 | 0 | |
| R12. Karatsuba Multiplication, Newton's Method | 53:80 | 0 | |
| R18. Quiz 2 Review | 1:05:30 | 0 | |
| R22. Dynamic Programming: Dance Dance Revolution | 53:16 | 0 | |
| R7. Comparison Sort, Counting and Radix Sort | 51:90 | 0 | |
| R10. Quiz 1 Review | 54:49 | 0 | |
| R11. Principles of Algorithm Design | 58:26 | 0 | |
| R5. Recursion Trees, Binary Search Trees | 59:16 | 0 | |
| R8. Simulation Algorithms | 55:39 | 0 | |
| R9. Rolling Hashes, Amortized Analysis | 1:01:10 | 0 | |
| R6. AVL Trees | 53:28 | 0 | |
| R2. Python Cost Model, Document Distance | 52:21 | 0 | |
| R3. Document Distance, Insertion and Merge Sort | 54:11 | 0 | |
| R13. Breadth-First Search (BFS) | 54:53 | 0 | |
| R14. Depth-First Search (DFS) | 53:39 | 0 | |
| R1. Asymptotic Complexity, Peak Finding | 53:50 | 0 | |
| R20. Dynamic Programming: Blackjack | 52:58 | 0 | |
|
|