Which of the sorts in the textbook can be characterized by the fact that the best case will have a running time of θ(n) if the data is already sorted?
I quicksort
II selection sort
III insertion sort
A) I
B) II
C) III
D) I and III

Question

Quizplus · Accepted Answer

Insertion sort has a best-case running time of θ(n) when the data is already sorted, as it only requires a single pass through the data with no swaps needed.

Which of the Sorts in the Textbook Can Be Characterized