Insertion Sort
	• But, how does the “direction” of comparison change this worst case situation? – if the list is already sorted and we compare left to right, vs. right to left – if the list is exactly in the opposite order? – how would this change if the data were stored in a linear linked list instead of an array?