Report Bug

QusIn a prime-checking algorithm, the loop typically runs from: QusPrime-checking algorithm की सामान्य time complexity क्या है?

A. 1 to n
B. 2 to n-1
C. 1 to √n
D. 2 to √n

Solution

D. 2 to √n

Explanation

To test primality efficiently, divisors only need to be checked up to √n.

Prime number check करने के लिए √n तक divisibility check करना पर्याप्त होता है।