Class notes
Design and Analysis of Algorithm:- (Design Techniques: Divide and Conquer, The Greedy Method, Dynamic Programming)
- Course
- Institution
- Book
Design Techniques: Divide and Conquer: General Method, Binary Search, Finding Maximum and Minimum, Strassen’s Matrix Multiplication The Greedy Method: General Method: Knapsack Problem, Tree Vertex Splitting problem. Dynamic Programming: General Method, Multi-Stage Graph, String Editing. Backtra...
[Show more]