Which one of the following is the tightest upper bound that represents the…

GATE · 2013 · CS · Computer Science & IT

1. A.

   $O(log \ n)$

2. B.

   $O(n)$

3. C.

   $O(n \ log \ n)$

4. D.

   $O(n^2)$

Attempted by 1308 students.