Quicksort
	• We come to the realization that in an average-case behavior, quicksort has an efficiency of O(N*log2N). – This means that on large arrays, expect Quicksort to run significantly faster than the insertion sort. – Quicksort is important to learn because its average case is far better than its worst case behavior -- and in practice it is usually very fast.