the even numbers are not checked even once throughout the process. Why this code performs better than already accepted ones: Checkout the results for different N values in the end. My code takes significantly lesser iteration to finish the job. 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 () If a number has no factors except 1 and itself, then it is called a prime number. So I did try changing my 2nd loop to for (int j=2 j It mentions something about square root of a number. bers using sigma notation is denoted as follows : 100 i 1 + 2 + i 1. 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. Sieve of Eratosthenes Algorithm to obtain the list of all prime numbers less.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |