Closest pair in the plane we have proved: can be improved to O(n log n) by being more careful about maintaining sorted lists April 22, 2014CS38 Lecture 743 Theorem: There is an O(n log 2 n) time algorithm for finding the closest pair among n points in the plane.
{}