C. Analysis of Algorithms and Algorithmic Strategies
Big-O Omega and Theta notations
Upper Bound (e.g., Analysis of Heapsort) and Lower Bound For Sorting with Comparisons
Union-Find Algorithm
Divide and Conquer Strategy and Solving Recurrence Relations: e.g. Analysis of Merge sort, Quick-sort, K-th Selection Strassen' s Matrix Multiplication
Greedy Strategy e.g. Minimum Spanning Tree (Prim, Kruskal). Shortest Path (Dijkstra)