void sieve(set<int>& intSet, int n)
{
ostream_iterator<int> screen(cout, " ");     
 
int i = n;
int j = 2;
  // K is the value that will be multiplied
  for (int k = 2; k < n; k = k * j)
     {
        cout << "Will erase value: " << k << endl;
        intSet.erase(k);
        j++;
        k++;
     }
 
for (int h = 2; h < i;h++)
    {
    cout << "value of h = ";
    copy(intSet.begin(), intSet.end(), screen);
    cout << endl;
    }
}

for (2 to n - n being maxsize)
insert value from 2 - n into array/set
for j is beginning value to limit (sqrt n(maxsize)
   set.erase( i * j);

for (int i = 2; i <= n; i++)                      
{ 
    intSet.insert(i);
    double limit = sqrt(n);
    cout << "in outter loop" << endl;
       for (set<int>::const_iterator j = intSet.begin(); *j <= limit; j++)
         {
         cout << "in innner loop" << endl;
         intSet.erase((*j * n));
         }
         cout << "after inner loop" << endl;
}

#include <cstdio>
#define MAX 100000
 
bool prime[ MAX ];
 
void sieve() {
     for( int i = 0; i < MAX; ++i ) prime[i] = 1;
     prime[1] = 0;
     for( int i = 2; i < MAX; ++i )
          for( int j = 2*i; j < MAX; j += i )
               prime[j] = 0;
}
 
int main( void )
{
    sieve();
    for( int i = 1; i <= 100; ++i )
         if( prime[i] ) printf( "%d\n", i );
 
    scanf( "\n" );
    return 0;
}

for (int i = 2; i <= n; i++)                      
{ 
    intSet.insert(i);
}

ostream_iterator<int> screen(cout, " "); 
...
...
//prints out initial set data 2 to n
copy(intSet.begin(), intSet.end(), screen);

// sets limit to sqrt of max (10)
double limit = sqrt(n);
 
for (set<int>::const_iterator m = intSet.begin(); *m <= n; ++m)
{
   for (set<int>::const_iterator k = intSet.begin(); *k <= n; ++k)
   {
 
   }  
}

intSet.erase(*m * *n);

intSet.erase(*m * *n);

double limit = sqrt(n);

int limit = (int)sqrt(n);
 
for (set<int>::const_iterator m = intSet.begin(); *m <= limit; ++m)
{
   for (set<int>::const_iterator k = intSet.begin(); *k <= limit; k++)
   {
      intSet.erase(*m * *k);
   }  
}

for (set<int>::const_iterator m = intSet.begin(); *m <= 10; ++m)
{
   for (set<int>::const_iterator k = intSet.begin(); *k <= 10; k++)
   {
      cout << "( " << *m << " * " << *k << " ) = " << *m * *k << endl;
 /* if (*m % 2 == 0)
         intSet.erase(*m); */
      intSet.erase(*m * *k);
   }      
}

#include <iostream>
#include <set>
#include <iterator>
#include <cmath>
 
using namespace std;
 
void sieve(set<int> &, int);
void print_primes(const set<int>&);
 
int main()
{
   set<int> intSet;
   int input;
 
   //gets input from file or keyboard
   cin >> input;
   //creates the list set from 2 to input value
   for (int i = 2; i <= n; i++)                      
   { 
    intSet.insert(i);
   }
 
   sieve(intSet, input);
   system("PAUSE");
    return 0;
}
 
void sieve(set<int>& intSet, int n)
{
ostream_iterator<int> screen(cout, " ");     
 
//prints out initial set data 2 to n
copy(intSet.begin(), intSet.end(), screen); 
 
int limit = (int)sqrt(n);
 
for (set<int>::const_iterator m = intSet.begin(); *m <= limit; ++m)
{
   for (set<int>::const_iterator k = intSet.begin(); *k + 1 <= n; k++)
   {
      //cout << "( " << *m << " * " << *k << " ) = " << *m * *k << endl;
      if (*k % *m == 0)
         intSet.erase(*k); 
      intSet.erase(*m * 2);
      if (*k >= limit)
         intSet.erase(*k);
   }      
}
//test print of set from beg. -> end
copy(intSet.begin(), intSet.end(), screen);      
} 
 
void print_primes(const set<int> & s)
{
 
}

   for (int i = 2; i <= n; i++)

int input;
...
cin >> input;
...
sieve(intSet, input);
 
SIEVE function:
void sieve(set<int>& intSet, int n)
{
...