MIT OpenCourseWare
5,896 videos, +2,320,000 subscribers


Playlist:
MIT 6.006 Introduction to Algorithms, Fall 2011 (Youtube)
View descriptionHide description
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. less
47 videos is founds.


name
timeviews
11. Integer Arithmetic, Karatsuba Multiplication47:240
9. Table Doubling, Karp-Rabin52:470
5. Binary Search Trees, BST Sort52:400
7. Counting Sort, Radix Sort, Lower Bounds for Sorting52:900
4. Heaps and Heap Sort52:320
6. AVL Trees, AVL Sort51:590
3. Insertion Sort, Merge Sort51:200
2. Models of Computation, Document Distance48:520
12. Square Roots, Newton's Method51:170
14. Depth-First Search (DFS), Topological Sort50:310
24. Topics in Algorithms Research46:460
23. Computational Complexity51:120
16. Dijkstra51:260
19. Dynamic Programming I: Fibonacci, Shortest Paths51:470
18. Speeding up Dijkstra53:160
1. Algorithmic Thinking, Peak Finding53:220
15. Single-Source Shortest Paths Problem53:150
Recitation 9b: DNA Sequence Matching57:280
R24. Final Exam Review51:440
R21. Dynamic Programming: Knapsack Problem1:09:120
R23. Computational Complexity47:140
R19. Dynamic Programming: Crazy Eights, Shortest Path52:470
R16. Rubik's Cube, StarCraft Zero54:360
R15. Shortest Paths56:310
8. Hashing with Chaining51:160
20. Dynamic Programming II: Text Justification, Blackjack52:120
10. Open Addressing, Cryptographic Hashing50:550
13. Breadth-First Search (BFS)50:480
21. DP III: Parenthesization, Edit Distance, Knapsack52:410
22. DP IV: Guitar Fingering, Tetris, Super Mario Bros.49:200
17. Bellman-Ford48:510
R12. Karatsuba Multiplication, Newton's Method53:800
R18. Quiz 2 Review1:05:300
R22. Dynamic Programming: Dance Dance Revolution53:160
R7. Comparison Sort, Counting and Radix Sort51:900
R10. Quiz 1 Review54:490
R11. Principles of Algorithm Design58:260
R5. Recursion Trees, Binary Search Trees59:160
R8. Simulation Algorithms55:390
R9. Rolling Hashes, Amortized Analysis1:01:100
R6. AVL Trees53:280
R2. Python Cost Model, Document Distance52:210
R3. Document Distance, Insertion and Merge Sort54:110
R13. Breadth-First Search (BFS)54:530
R14. Depth-First Search (DFS)53:390
R1. Asymptotic Complexity, Peak Finding53:500
R20. Dynamic Programming: Blackjack52:580



Main - About - Add your channel.
Share on :

[Mobile version] [https://www.facebook.com/listubes]
Listubes, Copyright 2024