16 миллионов подписчиков
115 видео
[New] Matrix Chain Multiplication using Dynamic Programming Formula
4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming
Bresenham's Line Drawing Algorithm
2.6.3 Heap - Heap Sort - Heapify - Priority Queues
4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming
7.3 Traveling Salesman Problem - Branch and Bound
DDA Line Drawing Algorithm - Computer Graphics
4.8 Reliability Design - Dynamic Programming
8.1 NP-Hard Graph Problem - Clique Decision Problem
6.4 Hamiltonian Cycle - Backtracking
1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find
4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula
1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1
Java AWT - #1
2.7.1 Two Way MergeSort - Iterative method
1.4 Frequency Count Method
2.8.2 QuickSort Analysis
4.4 Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming
Shortest Path Algorithms (Dijkstra and Bellman-Ford) - Simplified
3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method
4.2 All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming
5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search
4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming
4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming
3.4 Huffman Coding - Greedy Method
1.11 Best Worst and Average Case Analysis
4.5 0/1 Knapsack - Two Methods - Dynamic Programming
3.5 Prims and Kruskals Algorithms - Greedy Method
Stack vs Heap
1.6 Classes of functions
1. Introduction to Algorithms
2.6.2 Binary Search Recursive Method
2.7.2. Merge Sort Algorithm
6 Introduction to Backtracking - Brute Force Approach
1.5.1 Time Complexity #1
Tree Traversal
10.1 AVL Tree - Insertion and Rotations
2.9 Strassens Matrix Multiplication
Java AWT Event Handling #3
5.2 Articulation Point and Biconnected Components
6.1 N Queens Problem using Backtracking
1.5.3 Time Complexity of While and if #3
6.2 Sum Of Subsets Problem - Backtracking
Tower of Hanoi Problem - Made Easy
2.1.2 Recurrence Relation (T(n)= T(n-1) + n) #2
2.8.1 QuickSort Algorithm
Row-Major and Column-Major Mapping
3.3 Optimal Merge Pattern - Greedy Method
2. Why and How Java is platform independent
4.3 Matrix Chain Multiplication - Dynamic Programming
Pointer Arithmetic - *p++; *++p; ++*p;
1.3 How Write and Analyze Algorithm
Hashing Technique - Simplified
