Primes Thingy In C++

Primes.cpp

#include <iostream>
#include <deque>

typedef std::deque<int> mydeque;

void my_insert( mydeque & factors, int factor ) {
	int where = factor, count = factors.size();
	while( where < count && factors[where] ) where += factor;
	if( where >= count ) factors.resize( where + 1 );
	factors[ where ] = factor;
}

int main() {
	mydeque primes;
	mydeque factors;
	int a_prime = 3, a_square_prime = 9, maybe_prime = 3;
	factors.resize(3);
	std::cout << "2 3 ";

	while( maybe_prime <= 999 ) {
		int factor = factors.front();
		maybe_prime += 2;
		if( factor ) {
			my_insert( factors, factor );
		} else if( maybe_prime < a_square_prime ) {
			std::cout << maybe_prime << " ";
			primes.push_back( maybe_prime );
		} else {
			my_insert( factors, a_prime );
			a_prime = primes.front();
			primes.pop_front();
			a_square_prime = a_prime * a_prime;
		}
		factors.pop_front();
	}

	std::cout << std::endl;
	return 0;
}

http://codepad.org/GxBbA7YY