# Intermediary Algorithm

- Institution: IISc Bangalore
- Department: Computer Science and Engineering
- Teacher: Prof. C Pandu Rangan
- Level: Undergraduate
- Language: English
- Subjects: Computer science, Engineering
- Source: [NPTEL](https://nptel.ac.in/courses/106108001)
- Licence: [CC BY-NC-SA](https://nptel.ac.in/faq) (Non-commercial use only.)
- Syllabus: [at the source](https://nptel.ac.in/courses/106108001)
- Who can watch: Tweens profiles and older (sources give no ratings; placed by Invisible Network from the source's own words)

A typical UG course on algorithms will cover some of these topics but at an introductory level. These algorithms are based on great ideas and there is a delightful/advanced mathematics involved in the analysis of these algorithms. The aim of this course is to give an advanced and more complete treatment of the topics listed.

Intended audience: B.Tech 3rd or 4th year, M.Tech

Prerequisites: B.Tech (Discrete Maths, Basic Data Structures/ Algorithms)

## Lectures

1. [Merge Sort](https://invisiblenetwork.ai/learn/nptel/106108001/cf13b42bc2ba) (YouTube)
2. [Analysis of Merge Sort - Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/7a5c80e4ff3e) (YouTube)
3. [Analysis of Merge Sort - Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/18cf0dd8e4d1) (YouTube)
4. [Analysis of Merge Sort - Part 3](https://invisiblenetwork.ai/learn/nptel/106108001/312ebdb82166) (YouTube)
5. [Finding MIN & MAX](https://invisiblenetwork.ai/learn/nptel/106108001/9621d0da84be) (YouTube)
6. [Analysis of MIN-MAX Algorithm - Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/388ce78f01c9) (YouTube)
7. [Analysis of MIN-MAX Algorithm - Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/773cdb6e134d) (YouTube)
8. [Analysis of MIN-MAX Algorithm - Part 3](https://invisiblenetwork.ai/learn/nptel/106108001/49187fceb10d) (YouTube)
9. [Analysis of MIN-MAX Algorithm - Part 4](https://invisiblenetwork.ai/learn/nptel/106108001/bd02b26d40c9) (YouTube)
10. [Karastuba's Algorithm](https://invisiblenetwork.ai/learn/nptel/106108001/c60ba6c9b354) (YouTube)
11. [Analysis of Karastuba's Algorithm](https://invisiblenetwork.ai/learn/nptel/106108001/15cc500e08bd) (YouTube)
12. [More for less](https://invisiblenetwork.ai/learn/nptel/106108001/5fab4e728270) (YouTube)
13. [Maximum Subarray Sum Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/6365de6c5a3f) (YouTube)
14. [Maximum Subarray Sum Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/e2abda7b71fa) (YouTube)
15. [Inversion Count Problem Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/c5660713f629) (YouTube)
16. [Inversion Count Problem Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/585818370344) (YouTube)
17. [Dominance Count Problem](https://invisiblenetwork.ai/learn/nptel/106108001/f25463079b06) (YouTube)
18. [Closest Pair Problem Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/d15a59532b51) (YouTube)
19. [Closest Pair Problem Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/3d1f6f715130) (YouTube)
20. [Closest Pair Problem Part 3](https://invisiblenetwork.ai/learn/nptel/106108001/490af09cd11c) (YouTube)
21. [Greedy Algorithm](https://invisiblenetwork.ai/learn/nptel/106108001/b8a729edfcc2) (YouTube)
22. [Knapsack Problem](https://invisiblenetwork.ai/learn/nptel/106108001/2d952e8686c0) (YouTube)
23. [Huffman Codes Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/a9119437639c) (YouTube)
24. [Huffman Codes Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/ef43aa168cea) (YouTube)
25. [Huffman Codes Part 3](https://invisiblenetwork.ai/learn/nptel/106108001/a862e3a1e33b) (YouTube)
26. [Minimum Spanning Tree Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/55b481134b39) (YouTube)
27. [Minimum Spanning Tree Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/863114a7b24d) (YouTube)
28. [Minimum Spanning Tree Part 3](https://invisiblenetwork.ai/learn/nptel/106108001/bfcce5ae8102) (YouTube)
29. [Minimum Spanning Tree Part 4](https://invisiblenetwork.ai/learn/nptel/106108001/dfb99879c599) (YouTube)
30. [Minimum Spanning Tree Part 5](https://invisiblenetwork.ai/learn/nptel/106108001/fb221702a27a) (YouTube)
31. [Minimum Spanning Tree Part 6](https://invisiblenetwork.ai/learn/nptel/106108001/84014baa7467) (YouTube)
32. [Amortized Analysis Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/d6074ef2a65d) (YouTube)
33. [Amortized Analysis Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/d585aa99b1a4) (YouTube)
34. [Splay Trees Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/873a6cb19d87) (YouTube)
35. [Splay Trees Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/1d614e694ae4) (YouTube)
36. [Fibonacci Heap Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/8ab0a7f9ab6b) (YouTube)
37. [Fibonacci Heap Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/ac68082eaa9e) (YouTube)
38. [Fibonacci Heap Part 3](https://invisiblenetwork.ai/learn/nptel/106108001/2d8cf4dfbb43) (YouTube)
39. [Fibonacci Heap Part 4](https://invisiblenetwork.ai/learn/nptel/106108001/33595097ec47) (YouTube)
40. [Prim's Algorithm Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/ff073072e2d4) (YouTube)
41. [Prim's Algorithm Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/640ef3869f0c) (YouTube)
42. [Prim's Algorithm Part 3](https://invisiblenetwork.ai/learn/nptel/106108001/f1386d01ccf9) (YouTube)
43. [Depth First Search - Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/0ba50f4fcce7) (YouTube)
44. [Depth First Search - Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/88b41538d43a) (YouTube)
45. [Depth First Search - Part 3](https://invisiblenetwork.ai/learn/nptel/106108001/9070ab13055d) (YouTube)
46. [Depth First Search - Part 4](https://invisiblenetwork.ai/learn/nptel/106108001/ae907dcd1b39) (YouTube)
47. [Strongly Connected Components Part 1](https://invisiblenetwork.ai/learn/nptel/106108001/afd47e8b6414) (YouTube)
48. [Strongly Connected Components Part 2](https://invisiblenetwork.ai/learn/nptel/106108001/ff445517f2a5) (YouTube)
49. [Lower Bound for MIN-MAX Algorithm](https://invisiblenetwork.ai/learn/nptel/106108001/828854680824) (YouTube)