![]() ![]() both inner and outer loops are checking only within possible limits. 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. Prime Numbers The term prime numbers (or prime) refers to a natural number greater than 1 that is not the sum of two smaller natural numbers.A composite number is a natural number greater than one that is not prime. So I did try changing my 2nd loop to for (int j=2 jc++ 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. There are 25 prime numbers between 1 and 100.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |