View
Tube
search
Sign in
Sign up
Subscriptions
Abdul Bari
Algorithms
27,940,398 views
84 items
Last updated on Jul 11, 2019
public playlist
Abdul Bari
11:49
1. Introduction to Algorithms
Abdul Bari
1:48
1.1 Priori Analysis and Posteriori Testing
Abdul Bari
5:37
1.2 Characteristics of Algorithm
Abdul Bari
10:37
1.3 How Write and Analyze Algorithm
Abdul Bari
12:22
1.4 Frequency Count Method
Abdul Bari
10:08
1.5.1 Time Complexity #1
Abdul Bari
14:13
1.5.2 Time Complexity Example #2
Abdul Bari
21:54
1.5.3 Time Complexity of While and if #3
Abdul Bari
3:10
1.6 Classes of functions
Abdul Bari
5:11
1.7 Compare Class of Functions
Abdul Bari
15:46
1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1
Abdul Bari
10:07
1.8.2 Asymptotic Notations - Big Oh - Omega - Theta #2
Abdul Bari
11:58
1.9 Properties of Asymptotic Notations
Abdul Bari
9:28
1.10.1 Comparison of Functions #1
Abdul Bari
10:26
1.10.2 Comparison of Functions #2
Abdul Bari
18:56
1.11 Best Worst and Average Case Analysis
Abdul Bari
26:04
1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find
Abdul Bari
7:04
2 Divide And Conquer
Abdul Bari
13:48
2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1
Abdul Bari
16:00
2.1.2 Recurrence Relation (T(n)= T(n-1) + n) #2
Abdul Bari
12:25
2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3
Abdul Bari
10:42
2.1.4 Recurrence Relation T(n)=2 T(n-1)+1 #4
Abdul Bari
8:10
2.2 Masters Theorem Decreasing Function
Abdul Bari
8:41
2.3.1 Recurrence Relation Dividing Function T(n)=T(n/2)+1 #1
Abdul Bari
7:26
2.3.2 Recurrence Relation Dividing [ T(n)=T(n/2)+ n]. #2
Abdul Bari
11:20
2.3.3 Recurrence Relation [ T(n)= 2T(n/2) +n] #3
Abdul Bari
16:50
2.4.1 Masters Theorem in Algorithms for Dividing Function #1
Abdul Bari
5:41
2.4.2 Examples for Master Theorem #2
Abdul Bari
5:37
2.5 Root function (Recurrence Relation)
Abdul Bari
19:36
2.6.1 Binary Search Iterative Method
Abdul Bari
7:11
2.6.2 Binary Search Recursive Method
Abdul Bari
51:08
2.6.3 Heap - Heap Sort - Heapify - Priority Queues
Abdul Bari
20:19
2.7.1 Two Way MergeSort - Iterative method
Abdul Bari
24:07
2.7.2. Merge Sort Algorithm
Abdul Bari
13:28
2.7.3 MergeSort in-depth Analysis
Abdul Bari
13:43
2.8.1 QuickSort Algorithm
Abdul Bari
11:37
2.8.2 QuickSort Analysis
Abdul Bari
23:40
2.9 Strassens Matrix Multiplication
Abdul Bari
12:02
3. Greedy Method - Introduction
Abdul Bari
15:30
3.1 Knapsack Problem - Greedy Method
Abdul Bari
13:29
3.2 Job Sequencing with Deadlines - Greedy Method
Abdul Bari
9:33
3.3 Optimal Merge Pattern - Greedy Method
Abdul Bari
17:44
3.4 Huffman Coding - Greedy Method
Abdul Bari
20:12
3.5 Prims and Kruskals Algorithms - Greedy Method
Abdul Bari
18:35
3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method
Abdul Bari
14:52
4 Principle of Optimality - Dynamic Programming introduction
Abdul Bari
21:07
4.1 MultiStage Graph - Dynamic Programming
Abdul Bari
14:26
4.1.1 MultiStage Graph (Program) - Dynamic Programming
Abdul Bari
14:13
4.2 All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming
Abdul Bari
23:00
4.3 Matrix Chain Multiplication - Dynamic Programming
Abdul Bari
52:02
[New] Matrix Chain Multiplication using Dynamic Programming Formula
Abdul Bari
18:40
4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming
Abdul Bari
17:12
4.4 Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming
Abdul Bari
28:24
4.5 0/1 Knapsack - Two Methods - Dynamic Programming
Abdul Bari
17:00
4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming
Abdul Bari
30:19
4.6 Optimal Binary Search Tree (Successful Search Only) - Dynamic Programming
Abdul Bari
57:00
4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming
Abdul Bari
17:18
4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula
Abdul Bari
26:32
4.8 Reliability Design - Dynamic Programming
Abdul Bari
23:35
4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming
Abdul Bari
18:31
5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search
Abdul Bari
8:37
5.2 Articulation Point and Biconnected Components
Abdul Bari
8:15
6 Introduction to Backtracking - Brute Force Approach
Abdul Bari
13:41
6.1 N Queens Problem using Backtracking
Abdul Bari
12:19
6.2 Sum Of Subsets Problem - Backtracking
Abdul Bari
15:52
6.3 Graph Coloring Problem - Backtracking
Abdul Bari
18:35
6.4 Hamiltonian Cycle - Backtracking
Abdul Bari
9:40
7 Branch and Bound Introduction
Abdul Bari
10:56
7.1 Job Sequencing with Deadline - Branch and Bound
Abdul Bari
10:48
7.2 0/1 Knapsack using Branch and Bound
Abdul Bari
24:42
7.3 Traveling Salesman Problem - Branch and Bound
Abdul Bari
31:53
8. NP-Hard and NP-Complete Problems
Abdul Bari
17:14
8.1 NP-Hard Graph Problem - Clique Decision Problem
Abdul Bari
18:56
9.1 Knuth-Morris-Pratt KMP String Matching Algorithm
Abdul Bari
23:50
9.2 Rabin-Karp String Matching Algorithm
Abdul Bari
43:08
10.1 AVL Tree - Insertion and Rotations
Abdul Bari
39:41
10.2 B Trees and B+ Trees. How they are useful in Databases
Abdul Bari
22:44
Asymptotic Notations - Simplified
Abdul Bari
17:04
Hashing Technique - Simplified
Abdul Bari
26:13
Shortest Path Algorithms (Dijkstra and Bellman-Ford) - Simplified
Abdul Bari
19:13
BFS DFS - Simplified
Abdul Bari
9:32
Tower of Hanoi Problem - Made Easy
Abdul Bari
19:16
Row-Major and Column-Major Mapping
Abdul Bari
16:38
Merge Sort Algorithm - Hindi