- Introduction to Algorithms
- Asymptotic Notation
- Big O notation
- Omega notation
- Theta notation
- Big O vs Omega vs Theta
- Algorithm Analysis
- Worst, best and average case analysis
- Time and space complexity
- Time complexity classes
- Sorting Algorithms
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Radix Sort
- Comparison of Sorting Algorithms
- Prims algorithm
- Kruskal’s algorithm
- Reliability design with example
- NP-hard vs NP-complete