We are cover in this playlist------------- Unit – I Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of Functions, Performance Measurements, Sorting and Order Statistics - Shell Sort, Quick Sort, Merge Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time. Unit - || Advanced Data Structures: Red-Black Trees, B – Trees, Binomial Heaps, Fibonacci Heaps, Tries, Skip List Unit - ||| Divide and Conquer with Examples Such as Sorting, Matrix Multiplication, Convex Hull and Searching. Greedy Methods with Examples Such as Optimal Reliability Allocation, Knapsack, Minimum Spanning Trees – Prim’s and Kruskal’s Algorithms, Single Source Shortest Paths - Dijkstra’s and Bellman Ford Algorithms. Unit - |V Dynamic Programming with Examples Such as Knapsack. All Pair Shortest Paths – Warshal’s and Floyd’s Algorithms, Resource Allocation Problem. Backtracking, Branch and Bound with Examples Such as Travelling Salesman Problem, Graph Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of Subsets. Unit - V Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching, Theory of NPCompleteness, Approximation Algorithms and Randomized Algorithms.
![Recurrence Relation [ T(n)= 3T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm](/api/proxy/image?url=https://i.ytimg.com/vi/xXQI5ICaGjM/sddefault.jpg&local=true)
![Recurrence Relation [ T(n)= 2T(n/2) + nlogn ] | Master Theorem | Example#2 | Algorithm](/api/proxy/image?url=https://i.ytimg.com/vi/Ufe1nFg17PM/sddefault.jpg&local=true)
![Recurrence Relation [ T(n)= 2T(n/4) + n^0.51 ] | Master Theorem | Example#3 | Algorithm](/api/proxy/image?url=https://i.ytimg.com/vi/_ZvZMQCWSoc/sddefault.jpg&local=true)
![Recurrence Relation [ T(n)= √2T(n/2) + logn ] | Master Theorem | Example#4 & #5 | Algorithm](/api/proxy/image?url=https://i.ytimg.com/vi/TW2wMVAuFi0/sddefault.jpg&local=true)
![Recurrence Relation [ T(n)= 3T(n/2) + n/2 ] | Master Theorem | Example#6 | Algorithm](/api/proxy/image?url=https://i.ytimg.com/vi/ZKtUG6sUdUM/sddefault.jpg&local=true)
![Recurrence Relation [ T(n)= 2T(n/2) + n ] | Recursion Tree Method | Example#1 | Algorithm](/api/proxy/image?url=https://i.ytimg.com/vi/xazo-kMUUyU/sddefault.jpg&local=true)
![Recurrence Relation [ T(n)= 2T(n/2) + C.n ] | Recursion Tree Method | Example#2 | Algorithm](/api/proxy/image?url=https://i.ytimg.com/vi/VO1Bhlf6qHY/sddefault.jpg&local=true)
![Recurrence Relation [ T(n)= 3T(n/4) + C.n^2 ] | Recursion Tree Method | Example#3 | Algorithm](/api/proxy/image?url=https://i.ytimg.com/vi/F6tL_24gjWU/sddefault.jpg&local=true)
