Hemnath-D opened this issue 4 years ago · 2 comments
All the prime numbers that are stored in the prime array can be cached in the store for quick computation using binary search in the future. Similarly, the sieve array can also be cached. The cached sieve array can be reused for future computations.
Great!
PR #2 fixed this issue.