Algoteka

Sample #36: O(n log n) Divide-and-conquer readable solution

Discussion page for sample: 2D Closest Pair of Points Problem - O(n log n) Divide-and-conquer readable solution