The time complexity for the Sieve of Eratosthenes algorithm is $\_\_\_\_\_\_\_\_.$

O$(2^$n$)$

O$($logn$)$

O$($n$^(1\mathrm{.}5)/$logn$)$

O$($n$)$