dlpasco: If you can, reducing a problem to O(25^2) beats the hell out of going from O(n^2) to O(n log n). Faster isn't as good as not doing it at all - http://twitter.com/dlpasco...