Need some help (now its in the right place)

[Nerdrage23]

OK. I posted this in the wrong place to begin with as well as phrased it wrong. I am trying to better understand the Sieve of Eratosthenes problem. It needs to have values v[0]=0, v[1]=1...v[n]=n. It needs to find the prime numbers and delete the locations of the numbers that are not prime. Does anyone have a version of this that I can mess around with? I understand the logic, I am just having a TON of syntactic issues... :/ Any help would be great.

[ne555]

> I understand the logic, I am just having a TON of syntactic issues...
write the pseudocode and I'll translate it.

http://www.cplusplus.com/forum/articles/40071/#msg216269

[TheIdeasMan]

Nerdrage23 wrote:

I am just having a TON of syntactic issues...

Syntax issues are probably a good thing for you at this stage. At least you can learn from where you went wrong - Improve your knowledge & make less mistakes next time.