项目作者: 0deadLock0

项目描述 :
Brute Force to find the minimum distance between 2 points in a set of n points takes (n^2) computations. Can we do better?
高级语言: Python
项目地址: git://github.com/0deadLock0/Efficient-Closest-Pair-of-Points.git