reduce time complexity of selecting k neighbors using heapq (#90)
reduce time complexity of selecting k neighbors using heapq (#90)

* reduce time complexity in selecting k neighbors from nlog(n) to nlog(k)

* heap by key

NicolasHug/Surprise,NicolasHug/Surprise