both inner and outer loops are checking only within possible limits. Why this code performs better than already accepted ones: Checkout the results for different N values in the end. List of prime numbers up to 1 000 000 000 000 (1000 billion) Prime number per page : Export as text. ![]() 2) Every even positive integer greater than 2 can be expressed as the sum of two Primes. 1) Every number greater than 1 can be divided by at least one prime number. Therefore, the Number of Prime between 1 to 100 is 25. My code takes significantly lesser iteration to finish the job. Here, we can see that the total count of prime numbers is 25. Using Sieve of Eratosthenes logic, I am able to achieve the same results with much faster speed. ![]() How would I need to change this code to the way my book wants it to be? int main () So I did try changing my 2nd loop to for (int j=2 j ![]() This c++ code prints out the following prime numbers: 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97.Ä«ut I don't think that's the way my book wants it to be written.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |