Question

Arrange the names Brenda, Doris, Raymond, Steve, Timothy, and William in an order that requires the least number of comparisons when sorted by the insertion sort algorithm.

Answer 1

They are already alphabetically ordered, which is optimal for insertion sort because insertion sort will go through the list only once, i.e. O(n).