one million prime numbers

By -
suppose you are provided with a function isPrime() that checks for prime number in o(n) .what if you have to generate first one million prime numbers,will you call the same function to generate one million prime numbers?
suggest any optimization.

Comments

Post a Comment

Popular posts from this blog

By -
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
Read more