fast closest pairs -- 2

Job ID: 33947247

Budget: $30 – $250 USD

Implementing the divide-and-conquer based closest pair algorithm and computing the distance between all pairs of points and remembering the shortest distance.