Design Analysis and Algorithm

Lecture notes of MIT On book Design and Analysis of Algorithm by Coreman

• Introduction Analysis of Algorithms, Insertion Sort, Mergesort
• Asymptotic Notation
  
• Divide-and-Conquer: Strassen, Fibonacci
• Quicksort, Randomized Algorithms
• Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
• Order Statistics, Median
• Hashing, Hash Functions
• Universal Hashing, Perfect Hashing
• Relation of BSTs to Quicksort,Analysis of Random BST
• Red-black Trees, Rotations, Insertions, Deletions

Other Books on Analysis and Algorithm :-

• Lecture from Princeton University
• Link Evolution: Analysis And Algorithm