26 Jun
2008
26 Jun
'08
1:39 p.m.
On 6/26/08, Andrew Wagner
Did they score you on coding or on geometry?
It was definitely more on coding and my ability to think about the problem.
For what it's worth, a 3-dimensional kd tree really flew on this problem.
I did some reading up on this, and it seems interesting. It would be need to implement something like this in Haskell, but I can't seem to find any detailed specs on the data-structure. Got any recommendations?
http://en.wikipedia.org/wiki/Kd_tree -- Sebastian Sylvan +44(0)7857-300802 UIN: 44640862