Pollard's rho algorithm for logarithms: Difference between revisions

Content deleted Content added
fix link to C (programming language), Replaced: CC using AWB
Complexity: clarify
Line 102:
 
==Complexity==
The running time is approximately O(<math>\sqrt{n}</math>) for a number ''n''.
 
==References==