Career Tracks
Exams
MCQ
Companies
Opportunities
Pricing
MCQ Practice
Programming
Time & Space Complexity
Question
Easy
tcs-nqt
Which of the following has the highest time complexity for large n?
A
O(n log n)
B
O(n²)
C
O(n³)
D
O(2^n)
Show Answer
← Back to Time & Space Complexity questions
Which of the following has the highest time complexity for large n? | Time & Space Complexity MCQ | TomoLink | TomoLink
