Medium Understand Sorting & Searching Multiple Choice

What is the lower bound on the number of comparisons needed to sort n elements?

Understand — Tests comprehension and ability to explain concepts.

Answer Options

A O(n)

B Omega(n log n)

C Theta(n)

D O(n²)

Get the answer with a detailed explanation, plus practice 31+ more Sorting & Searching questions with adaptive quizzes and timed interviews.

This question is from the Sorting & Searching topic (Algorithms).

What is the time complexity of binary search on a sorted array of n elements?

Which sorting algorithm is stable and guarantees O(n log n) worst case?

What is the space complexity of mergesort?

Why does quicksort degrade to O(n²) on already-sorted input with last-element pivot?

Implement binary search to find the leftmost occurrence of a target.