Introduction to the Design and Analysis of Algorithms notes (3rd edition)

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. Backtracking: Basic 8 Queen Problem, Sum of Subset Problem.

Elementary Graph Algorithms: Representations of Graphs, Breadth First Search, Depth First Search, Minimum Spanning Trees: Kruskal and Prim’s Algorithms, Single Source Shortest Paths, All Pair Shortest Paths, Maximum Flow.

Additional Topics: String Matching, NP-Completeness: P and NP, NP-Completeness, Important NPComplete problems, Approximation Algorithms, Randomized Algorithms.

Contains all the examples as well as topics need to be revised for the exam.

this simple important lecture notes before begin to design and analysis algorithm

Introduction to Algorithm Analysis More than 300 Slides

Introduction to Algorithm Analysis Part 2