My opinion on the algorithm [number theory Tour] Pollard Rho factor decomposition

Algorithm code:

#include"stdio.h"#include"conio.h"Main () {intN,i; printf ("\nplease input a number:\n"); scanf ("%d",&N); printf ("%d=", N);  for(i=2; i<=n;i++)     while(n!=i) {if(n%i==0) {printf ("%d*", i); N=n/i; }      Else         Break; } printf ("%d", n);}

Correctness of the algorithm:

Although we test I are not guaranteed to be prime, but the output of I must be prime. This is because the qualitative factor of any number is smaller than itself, after testing the smaller number, such as assuming n%i (i==4) ==0 into the output link, but in fact i=2 cycle has been done, at this time n%4 can not be equal to 0. Try it a few more times and you'll understand.

My opinion on the algorithm [number theory Tour] Pollard Rho factor decomposition