Prime numbers
Background/Algorithm: The Sieve of Eratosthenes algorithm generates prime number using the follow algorithm.
1. Create a list the number from 1..n
2. Let p = 2 (the first prime number)
3. start from p count up in increments of p (2p,3p, 4p……) and mark it in the list
4. find the next number that is not marked set it to p; repeat step 3
Can someone help with this I am really new to c++..
1. Create a list the number from 1..n
2. Let p = 2 (the first prime number)
3. start from p count up in increments of p (2p,3p, 4p……) and mark it in the list
4. find the next number that is not marked set it to p; repeat step 3
Can someone help with this I am really new to c++..
Topic archived. No new replies allowed.