Description: Prime test,
If the multiplication, division ( including the modulus as a constant time ),
The time complexity of the algorithm is ( k ) = ( log m ) = O ( log n ).
And when the N-pole greatly, and N in the same order of magnitude of two numbers multiplication and division,
Not more than O ( log2n ) binary bit operations.
Now the time complexity of the algorithm is O ( log3n ) binary operation
To Search:
File list (Check if you may need any files):
prime TEST.cpp
Download