Learn · Fundamental Algorithms: Design and Analysis

Lecture 2 of 20Week 1

Lecture 02: Solving Recurrences

Prof. Sourav Mukhopadhyay · IIT Kharagpur

Credits and licence

From
Fundamental Algorithms: Design and Analysis, IIT Kharagpur (at NPTEL)
Licence
CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
Attribution
NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
Who can watch
Tweens profiles and older. How courses are placed

All the lectures

  1. Lecture 01 : Insertion Sort and Asymptotic Analysis Video
  2. Lecture 02: Solving Recurrences Video
  3. Lecture 03: Divide and Conquer Paradigm Video
  4. Lecture 04: Quick Sort Video
  5. Lecture 05 : Heap Sort Video
  6. Lecture 06: Decision Tree Video
  7. Lecture 07: Linear Time Sorting Video
  8. Lecture 08: Order Statistics Video
  9. Lecture 09: Hashing Video
  10. Lecture 10: Universal Hashing, BST Sort Video
  11. Lecture 11: Red-Black Tree Video
  12. Lecture 12: Augmenting Data Structure Video
  13. Lecture13: Computational Geometry Video
  14. Lecture 14: Van Emde Boas Data Structure Video
  15. Lecture 15: Dynamic Programming Video
  16. Lecture 16 : Graph Algorithm Video
  17. Lecture 17 : BFS and DFS Video
  18. Lecture 18 : Dijkstra Video
  19. Lecture 19 : Bellman Ford Video
  20. Lecture 20 : Floyd Marshall Video