Question: Here's how the problem works:
Suppose that we use insertion sort on a randomly ordered array where items have only one of three values. Is the running time linear, quadratic, or something in between?
Rationalize your answer by math, measurement or example, something convincing.