A quick vectorized implementation of the K-Nearest-Neighbors algorithm.
py 2D_example.py
py 3D_example.py
Here is a visual animation of 3D_example.py.
The points with a dark outline around them indicate they are test data points, and these are points which were classified
based on their nearest neighbors, with the K used being the default sqrt(N) where N is the number of data points.