The best comparison sort in terms of order is:
A) O(1)
B) O(n)
C) O(log(n))
D) O(nlog(n))

Name: The best comparison sort in terms of order is: A) O(1) B) O(n) C) O(log(n)) D) O(nlog(n))
Brand: Quizplus
Rating: 4.7 (36 reviews)

Question

Quizplus · Accepted Answer

The best comparison-based sorting algorithms, such as mergesort and heapsort, have a time complexity of O(nlog(n)). This is the best possible time complexity for a comparison sort as proven by the comparison sort lower bound theorem.

The Best Comparison Sort in Terms of Order Is