Question

To judge an integer N (>10) is prime or not, we need to check if it is divisible by any odd number from 3 to
N
​
. The time complexity of this algorithm is __.

( 2 point(s) )

A.
O(
N
​
)


B.
O(N/2)


C.
O(
N
​
logN)


D.
O(0.5logN)​

Answer 1

Answer:

ijooookkkooiiooooookkkkkkkk

boojbinkml