We will study some factorization algorithms,firstly we will use Eratosthène's, algorithm, also Rabin-Miller's algorithm to determine if the number is prime, if not we will then factorise with a fairly complex algorithm. After that we will compare running time results we a classical algorithm.
taper par exemple: ./app 1000 (pour factoriser le nombre 1000)