12. Geometric and Randomized Algorithms

This is the twelfth short course – Geometric and Randomized Algorithms – of the Master Series on the Analysis of Algorithms. In this course, you’ll delve into geometric algorithms, focusing on the Sweep Line Algorithm and its various applications in computational geometry. Additionally, you’ll explore randomized algorithms, including the Hiring Problem and Randomized Quicksort, enhancing your understanding of how randomness can be utilized in algorithm design to improve performance and efficiency.