For factoring a positive integer n into primes, four variants of the elementary algorithm are analysed. The worst-case time complexities vary from Θ(√n) up to Θ(√nlog n). The average time complexities vary from Θ(√n) up to Θ(√n/log² n). [ABSTRACT FROM AUTHOR]
No Comments.