Simple code to find divisors.
Original simple implementation.
Switch to sieve from elementary check-each-number implementation used as reference for speed improvement of sieve. Also added better documentation.
Minor logic improvements and code cleanup.
Reorganize algorithm to keep fit in processor cache and reduce page misses. Cheat a little bit by storing some original primes.
Use linked list to keep track of initial calculated primes. Tighten inner loops to speed up operations.
Added simple python implentation of un-optimized sieve for reference.
Added simple python find divors algorithm for reference.