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. Generate customizable number charts (including 100-chart) and lists to practice counting, skip counting, number writing, and the concept of multiples of a. 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 () Prime and Composite Numbers List Prime Numbers, Composite Numbers 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89. To do so, it starts with as the first prime number and marks all of its. It is based on marking as composite all the multiples of a prime. Sieve of Eratosthenes is one of the oldest and easiest methods for finding prime numbers up to a given number. So I did try changing my 2nd loop to for (int j=2 j
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |