Open In App

Algorithms Quiz | Sudo Placement [1.7] | Question 10

Last Updated : 22 Aug, 2018
Like Article
Like
Save
Share
Report

What will be the time complexity for finding all the primes smaller than N using Sieve method?
(A) O(sqrt(N) LogLog(N))
(B) O(N * LogLog(N))
(C) O(N * Log (N))
(D) O(sqrt(Log Log (N)))


Answer: (A)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post


Like Article
Suggest improvement
Previous
Next
Share your thoughts in the comments

Similar Reads