<br><br><div><span class="gmail_quote">On 6/26/08, <b class="gmail_sendername">Andrew Wagner</b> <<a href="mailto:wagner.andrew@gmail.com">wagner.andrew@gmail.com</a>> wrote:</span><blockquote class="gmail_quote" style="margin:0;margin-left:0.8ex;border-left:1px #ccc solid;padding-left:1ex">
> Did they score you on coding or on geometry?<br> ><br> <br> <br>It was definitely more on coding and my ability to think about the problem.<br> <br><br> > For what it's worth, a 3-dimensional kd tree really flew on this problem.<br>
><br> <br> <br>I did some reading up on this, and it seems interesting. It would be<br> need to implement something like this in Haskell, but I can't seem to<br> find any detailed specs on the data-structure. Got any<br>
recommendations?</blockquote></div><p><a href="http://en.wikipedia.org/wiki/Kd_tree">http://en.wikipedia.org/wiki/Kd_tree</a><br clear="all"></p><br>-- <br>Sebastian Sylvan<br>+44(0)7857-300802<br>UIN: 44640862