1. Урок 1. 00:05:21
    Introduction to Algorithmic Thinking
  2. Урок 2. 00:04:53
    Computational Problem Solving Using Algorithms
  3. Урок 3. 00:14:10
    Algorithmic Design Process
  4. Урок 4. 00:06:53
    Importance of Sorting
  5. Урок 5. 00:04:03
    Array Rotation
  6. Урок 6. 00:13:26
    Insertion Sort
  7. Урок 7. 00:16:57
    Merge Sort
  8. Урок 8. 00:05:57
    Sorting Types: Heaps
  9. Урок 9. 00:12:46
    Heap Sort
  10. Урок 10. 00:04:42
    Greedy Algorithms
  11. Урок 11. 00:04:28
    Topological Sorting
  12. Урок 12. 00:05:31
    Breadth First Traversal
  13. Урок 13. 00:04:53
    Depth First Traversal
  14. Урок 14. 00:05:23
    Introduction to Hashing
  15. Урок 15. 00:05:37
    DIJKSTRA Algorithm with example
  16. Урок 16. 00:04:29
    Open Addressing
  17. Урок 17. 00:03:30
    Open Addressing explained with example
  18. Урок 18. 00:02:43
    Finding Shortest Path In A Graph
  19. Урок 19. 00:02:24
    AVL trees
  20. Урок 20. 00:04:20
    AVL Trees Part 2
  21. Урок 21. 00:02:55
    Computational Complexity and Machine Learning
  22. Урок 22. 00:05:11
    Machine Learning