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
B) II
C) III
D) I and III

Question

Quizplus · Accepted Answer

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

Which of the Sorts in the Textbook Can Be Characterized