MCPcopy Create free account
hub / github.com/andeya/algorithm / FactorInt

Function FactorInt

mathutil/primes.go:273–305  ·  view source on GitHub ↗

FactorInt returns prime factorization of n > 1 or nil otherwise. Resulting factors are ordered by Prime. Typical run time is few µs.

(n uint32)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 4

TestFactorIntFunction · 0.85
TestFactorIntBFunction · 0.85
BenchmarkFactorIntFunction · 0.85

Calls 1

IsPrimeFunction · 0.85

Tested by 4

TestFactorIntFunction · 0.68
TestFactorIntBFunction · 0.68
BenchmarkFactorIntFunction · 0.68