Skip to content
Related Articles
Open in App
Not now

Related Articles

Algorithms | Analysis of Algorithms | Question 5

Improve Article
Save Article
Like Article
  • Difficulty Level : Medium
  • Last Updated : 16 May, 2019
Improve Article
Save Article
Like Article

Which of the following is not O(n2)?

(A)

(1510) * n + 12099

(B)

n1.98

(C)

n3/(sqrt(n))

(D)

(220) * n


Answer: (C)

Explanation:

The order of growth of option c is n2.5 which is higher than n2.


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

My Personal Notes arrow_drop_up
Like Article
Save Article
Related Articles
1. Analysis of Algorithms | Big-O analysis
2. Algorithms | Analysis of Algorithms (Recurrences) | Question 2
3. Algorithms | Analysis of Algorithms (Recurrences) | Question 3
4. Algorithms | Analysis of Algorithms | Question 19
5. Algorithms | Analysis of Algorithms (Recurrences) | Question 4
6. Algorithms | Analysis of Algorithms (Recurrences) | Question 11
7. Algorithms | Analysis of Algorithms (Recurrences) | Question 6
8. Algorithms | Analysis of Algorithms (Recurrences) | Question 7
9. Algorithms | Analysis of Algorithms (Recurrences) | Question 8
10. Algorithms | Analysis of Algorithms (Recurrences) | Question 9
Previous
Algorithms | Analysis of Algorithms | Question 4
Next
Algorithms | Analysis of Algorithms | Question 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty : Medium
Article Tags :
Report Issue
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox

Start Your Coding Journey Now!