The closest pair of points problem is a computational geometry problem which seeks to find the two points with the smallest distance between them from a set of n points. It was one of the first geometric problems studied in terms of computational complexity. It has applications in Euclidean plane.

This course explores the design and analysis of algorithms, algorithmic modelling techniques, and their efficiency. It aims to provide tools for designing and analyzing personal algorithms, using various analytical tools and frameworks. Some advanced topics not commonly covered in textbooks are also taught.