311 karma · joined August 1, 2012
Very easy to implement and much faster than even sieve of Atkin with a complexity of O((n log n)/12)
(SRM 363, HandShake problem): http://apps.topcoder.com/forums/?module=Thread&threadID=5843...
The idea is you brute force or hand calculate the first few numbers and then use the OEIS's wild card search.
[Algorithms][1] and [data structures][0] in Scala:
[0] https://github.com/vkostyukov/scalacaster [1] https://github.com/pathikrit/scalgos
After about 3-6 months of this, I can confidently say, I can pass the pure algo/data-structure rounds of any company..
But, a nice UI on top of brew casks would be nice!
Source: github.com/pathikrit/vocowl