Function comlib_math::factorize[][src]

pub fn factorize(n: u64) -> Vec<(u64, usize)>
Expand description

Factorizes the given integer into its prime factors.

Implements Pollard’s rho algorithm to find the factorization.

Time complexity

The expected time-complexity is O(n^(1/4)).