Home
About
Services
Projects
Careers
Learn
Contact
Log in
Get started
Logiquest
Q
Data Structures.complexity Analysis.15i3fp2
LogiQuest
Aptitude
Verbal
Reasoning
Programming
Technical
Interview
GK
Engineering
Puzzles
Coding
Online Tests
Sudoku
Leaderboard
Back to Complexity Analysis
3
Which grows fastest as n increases?
A
O(n²)
B
O(n log n)
C
O(n³)
D
O(2ⁿ)
View Answer
Workspace
Report
Save
Easy
Discussion (0)
No discussion yet. Ask a doubt or share a shortcut.
Log in
to join the discussion.
Home
Services
Learn
Contact Us
Log in