Sieve of Erathosthenes Algorithm in C++ Language (Finding all prime numbers)?

I need Eratosthenes Algorithm in C++ language (to find out prime numbers). I can write it in a few other ways, but I need to do it using a a vector container for the integers, and an array of bool initially set to true to keep track of the crossed off numbers. also by Changing the entry to false for integers that are crossed off the list.


I will appreciate any help. Partial code, if not all. Thank you very much.

Sieve of Erathosthenes Algorithm in C++ Language (Finding all prime numbers)?
I ran this a long time ago:





http://gd.tuwien.ac.at/perf/benchmark/ab...

pokemon cards