It is known that insertion sort has a best case running time of n and a worst case running time of n2. In that case, does it have a big theta value?
