Design and and Analysis of Algorithms notes

Design and and Analysis of Algorithms

1. Algorithm Analysis Techniques 
2. Asymptotic Notations
3. Divide and Conquer Paradigm
1. Binary Search 
2. Finding the maximum and minimum element of an array 
3. Merge sort 
4. Quick sort
4. Greedy Algorithm
5. Dynamic Programming Paradigm
1. Knapsack or Rucksack Algorithm
6. Dynamic programming VS Memoization VS Tabulation 
7. Amortized Analysis or Amortized Complexity