depth first search

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶CSE201, Lec 15: Karatsuba multiplication and Strassen's matrix multiplicationCSE201, Winter 2022: Analysis of AlgorithmsNotes
   +Watch later
2. 2▶CSE201, Lec 14: Linear time selection using divide and conquerCSE201, Winter 2022: Analysis of AlgorithmsNotes
   +Watch later
3. 3▶CSE201, Lec 13: Introduction to divide and conquer, Mergesort and the stock market problemCSE201, Winter 2022: Analysis of AlgorithmsNotes
   +Watch later
4. 4▶CSE201, Lec 12: Dijkstra's algorithms, All Pairs Shortest Paths, and matrix multiplicationCSE201, Winter 2022: Analysis of AlgorithmsNotes
   +Watch later
5. 5▶CSE201, Lec 11: Single source shortest paths and the Bellman-Ford algorithmCSE201, Winter 2022: Analysis of AlgorithmsNotes
   +Watch later
6. 6▶CSE201, Lec 10: Minimum Spanning TreesCSE201, Winter 2022: Analysis of AlgorithmsNotes
   +Watch later
7. 7▶CSE201, Lec 9: Huffman codingCSE201, Winter 2022: Analysis of AlgorithmsNotes
   +Watch later
8. 8▶CSE201, Lec 8: Greedy Algorithms; the Fractional Knapsack Problem and introduction to Huffman CodingCSE201, Winter 2022: Analysis of AlgorithmsNotes
   +Watch later
9. 9▶CSE201, Lec 7: Dynamic Programming for the Longest Common Subsequence and Optimal BST problemsCSE201, Winter 2022: Analysis of AlgorithmsNotes
   +Watch later
10. 10▶CSE201, Lec 6: Intro to Dynamic ProgrammingCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
11. 11▶CSE201, Lec 5: Using Depth-First Search to find Strongly Connected ComponentsCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
12. 12▶CSE201, Lec 4: More on Depth-First Search, Topologically sorting a DAGCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
13. 13▶CSE201, Lec 3: Depth First Search (DFS) and the concept of finishing timesCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
14. 14▶CSE201, Lec 2: More on the BFS invariant, and using BFS for 2-coloring/bipartitenessCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
15. 15▶CSE201, Lec 1:The Breadth First Search (BFS) invariantCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later