C++ Prime number task from the book
<p>I'm a C++ beginner ;)
How good is the code below as a way of finding all prime numbers between 2-1000:</p>

<pre><code>int i, j;

for (i=2; i&lt;1000; i++) {
  for (j=2; j&lt;=(i/j); j++) {
    if (! (i%j))
      break;
    if (j &gt; (i/j))
      cout &lt;&lt; i &lt;&lt; " is prime\n";
  }
}
</code></pre>
