Which of the sorts in the textbook can be characterized by the fact that even in the worst case the running time will be O(n log(n)))?
i.quicksort
II.selection sort
III.merge sort
A)I and III only
B)I only
C)II only
D)III only

Question

Quizplus · Accepted Answer

Merge sort has a worst-case running time of O(n log(n)), while quicksort can degrade to O(n^2) in the worst case, and selection sort has a worst-case running time of O(n^2).

Which of the Sorts in the Textbook Can Be Characterized