The question is to implement the pick k nearest items from a database. Give some acceleration tips for the situation.
Anonymous
Coding online in cpp. First get the Euclid distance of each items, then return the idx of the first k elements.
Check out your Company Bowl for anonymous work chats.