Regarding sorting lists, an algorithm such as QuickSort was preferred if the list was, for the most part, in random order, and that an algorithm such as Insertion Sort was preferred if the list was essentially in order.
Assuming you are starting with a list in ascending order, discuss to what degree the list needed to become "out of order" before one would choose QuickSort over Insertion Sort.