Career Tracks
Exams
MCQ
Companies
Opportunities
Challenges
Pricing
MCQ Practice
Programming
Time & Space Complexity
Question
Medium
tcs-nqt
What is the best-case time complexity of Insertion Sort?
A
O(n²)
B
O(n log n)
C
O(n)
D
O(1)
Show Answer
← Back to Time & Space Complexity questions
What is the best-case time complexity of Insertion Sort? | Time & Space Complexity MCQ | TomoLink | TomoLink
