![]() Note: Number 1 is neither a prime number nor a. the even numbers are not checked even once throughout the process. Why this code performs better than already accepted ones: To do this, we first need to list out all the prime numbers less than 200. 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 () 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 |