Sieve of Erotosthenes1 7. Project Euler #7 : 10001st prime Looking for large prime numbers obviously have to use mathematical searching prime number algorithm.Sieve of Eratosthenes is good algorithm for finding small prime numbers. 10,001st prime number is small, so, sieve of Erotosthenes algorithm is enough. Algorithm itself is very simple. Hold the array space to store a few, here and put on top of each put a few on top of each.Once a small number is .. 2015. 2. 27. 이전 1 다음