Prime Factorization of a Number

prime_factorize.cpp

prime_factorization(long x)
{
	long i;			/* counter */
	long c;			/* remaining product to factor */
	c = x;
	while ((c % 2) == 0) {
		printf("%ld\n",2);
		c = c / 2;
	}
	
        i = 3;
	while (i <= (sqrt(c)+1)) {
		if ((c % i) == 0) {
			printf("%ld\n",i);
			c = c / i;
		}
		else i = i + 2;
	}

	if (c > 1) printf("%ld\n",c);
}