What is the time complexity of the problem of sorting a list? A) $ \varTheta$(lg n) B) $ \varTheta$(n) C) $ \varTheta$(n lg n) D) $ \varTheta$(n²)

Question

Quizplus · Accepted Answer

The time complexity of most efficient sorting algorithms such as quicksort, mergesort, and heapsort is O(n log n). Therefore, the time complexity of sorting a list is Ω(n log n) and O(n log n). Choice C represents Θ(n log n) time complexity.

What Is the Time Complexity of the Problem of Sorting Θ \varThetaΘ

What Is the Time Complexity of the Problem of Sorting $\varTheta$