c++ Sieve of Eratosthenes implementation
<p>I have a function that filters numbers by removing multiples</p>

<pre><code>remove(int v[], int sz, int ind)
{

    for (int i = ind; i &lt; sz; ++i)
    {
    v[i]=v[i+1];
   }
    // Insert -1
    v[sz-1]=-4;//used as a filter
}
</code></pre>

<p>filter(array,size, index to start removing multiples, value all multiples are removed)</p>

<pre><code>void filter(int v[], int sz, int starti, int number)
{
    for(int i = starti; i &lt;= sz; i++)
   {   
    if (v[i] % number == 0) remove(v,sz,i);
    }
}
</code></pre>

<p>To call this on a work list array with numbers 0-100000</p>

<pre><code>for(int i = 0; i &lt; n; i++)

        {    filter(worklist,worklistSZ,i,i+1);

            // Copy the values into the primes array
            primes[i]=worklist[i];
        }
</code></pre>

<p>when ran under a function that prints the numbers and removes all -4's
I get...</p>

<pre><code>1 3 5 7 11 13 17 19 23 29 
31 37 41 43 47 53 59 61 67 71 
73 79 83 89 97 101 103 107 109 113 
127 131 137 139 149 151 157 163 167 173 
179 181 191 193 197 199 211 223 227 229 
233 239 241 251 257 263 269 271 277 281 
283 293 307 311 313 317 331 337 347 349 
353 359 367 373 379 383 389 397 401 409 
419 421 431 433 439 443 449 457 461 463 
467 479 487 491 499 503 509 521 523 541 
</code></pre>

<p>this is right but I need 2 to be the starting prime number not 1</p>
