Lec51 : Traveling Salesman Problem | Branch and Bound

Lec51: Heap Sort - Heapify Method

Lec50: Master Theorem- Solving Recurrence Relations

Lec49: Topological Sort- DFS Method

Lec48: Topological Sort- DFS Method

Lec47: Topological Sort- Source Removal Method

Lec46: Quick Sort Time Complexity

Lec45: Quick Sort Algorithm - Divide and Conquer

Lec44: Trick to Remember Strassen's Matrix Multiplication Formulas

Lec43: Strassen's Matrix Multiplication- Divide and Conquer

Lec42 : String Matching - Brute Force Approach

Lec41 : Comparing Orders of Growth - Limit-based Approach

Lec 40 : Traveling Salesman Problem | Branch and Bound

Lec39: Subset Sum problem - Backtracking

Lec 38 : N-Queens Problem - Backtracking

Lec37 : Warshall's Algorithm - Dynamic Programming

Lec36 : 0/1 Knapsack Problem - Dynamic Programming

Lec35 : Floyd's Algorithm- All-Pairs Shortest- Paths Problem

Lec34: 2-3 Trees- Example 3

Lec33 : 2-3 Trees- Example 2

Lec32 : 2- 3 Tree - Example1

Lec31 : AVL tree Construction - Example

Lec30 : AVL Tree Rotations - Transform and Conquer Approach

Lec29 : Transform and Conquer and AVL trees - Introduction

Lec28 : Dijkstra's Algorithm | Single source shortest Path