Fast prime factorization module

Question

I am looking for an implementation or clear algorithm for getting the prime factorization of N in either python, pseudocode or any

Answer 1

Even on the current one, there are several spots to be noticed.

1. Don't do checker*checker every loop, use s=ceil(sqrt(num)) and checher < s
2. checher should plus 2 each time, ignore all even numbers except 2
3. Use divmod instead of % and //