IISc Bangalore · Computer Science
Intermediary Algorithm
Prof. C Pandu Rangan · 49 free video lectures
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…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Merge Sort
- Analysis of Merge Sort - Part 1
- Analysis of Merge Sort - Part 2
- Analysis of Merge Sort - Part 3
- Finding MIN & MAX
- Analysis of MIN-MAX Algorithm - Part 1
- Analysis of MIN-MAX Algorithm - Part 2
- Analysis of MIN-MAX Algorithm - Part 3
- Analysis of MIN-MAX Algorithm - Part 4
- Karastuba's Algorithm
- Analysis of Karastuba's Algorithm
- More for less
- Maximum Subarray Sum Part 1
- Maximum Subarray Sum Part 2
- Inversion Count Problem Part 1
- Inversion Count Problem Part 2
- Dominance Count Problem
- Closest Pair Problem Part 1
- Closest Pair Problem Part 2
- Closest Pair Problem Part 3
- Greedy Algorithm
- Knapsack Problem
- Huffman Codes Part 1
- Huffman Codes Part 2
- Huffman Codes Part 3
- Minimum Spanning Tree Part 1
- Minimum Spanning Tree Part 2
- Minimum Spanning Tree Part 3
- Minimum Spanning Tree Part 4
- Minimum Spanning Tree Part 5
- Minimum Spanning Tree Part 6
- Amortized Analysis Part 1
- Amortized Analysis Part 2
- Splay Trees Part 1
- Splay Trees Part 2
- Fibonacci Heap Part 1
- Fibonacci Heap Part 2
- Fibonacci Heap Part 3
- Fibonacci Heap Part 4
- Prim's Algorithm Part 1
- Prim's Algorithm Part 2
- Prim's Algorithm Part 3
- Depth First Search - Part 1
- Depth First Search - Part 2
- Depth First Search - Part 3
- Depth First Search - Part 4
- Strongly Connected Components Part 1
- Strongly Connected Components Part 2
- Lower Bound for MIN-MAX Algorithm
From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IISc Bangalore.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights