Career Tracks
Exams
MCQ
Companies
Opportunities
Pricing
MCQ Practice
Programming
Time & Space Complexity
Question
Easy
tcs-nqt
Comparing two complexities: O(n log n) vs O(n²). For large n, which is smaller?
A
O(n²)
B
O(n log n)
C
They are equal
D
Depends on n
Show Answer
← Back to Time & Space Complexity questions
Comparing two complexities: O(n log n) vs O(n²). For large n, which is smaller? | Time & Space Complexity MCQ | TomoLink | TomoLink
