Abstract
For factoring a positive integer n into primes, four variants of the elementary algorithm are analysed. The worst-case time complexities vary from Θ() up to Θ(). The average time complexities vary from Θ() up to Θ().
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received August 21, 1998; revised September 14, 2000
Rights and permissions
About this article
Cite this article
Bahmann, H., Schatte, P. Analysis of Some Elementary Algorithms for Prime Factorization. Computing 66, 91–95 (2001). https://doi.org/10.1007/s006070170040
Issue Date:
DOI: https://doi.org/10.1007/s006070170040