I just copied the Miller-Rabin algorithm for primality testing from E-Maxx Algorithms. I wanted to know the time complexity of that function. Here is the link to that article.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
2 | adamant | 160 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | atcoder_official | 148 |
6 | nor | 148 |
8 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
I just copied the Miller-Rabin algorithm for primality testing from E-Maxx Algorithms. I wanted to know the time complexity of that function. Here is the link to that article.
Name |
---|
Fun fact: the latter implementation is bounded by a constant, and so is O(1).
Seriously though, why don't you at least begin reading the code to get the answer, and ask a concrete question once you have it? It's just a few nested loops anyway, no rocket science.
Perhaps this impl makes it clearer: link.
What is complexity of ipow() and for(int i = 0; i < e; i++).