i've been working on a prime number program on and off since last year and i thought everyone (who doesn't know this already) how slow cout really is. for example when running my program and couting all the primes between 1 and 10 million my program completed in 125.5 seconds whereas w/ cout commented out, the program ran in 17.7 seconds!!!
also, if any1 knows how fast direct access files are (in a vague comparision to whatever you can think of...) it would be nice. i am planning on implementing them to hold the found prime numbers.