"The running time of insertion sort is not Ω($n^{2}$) , since there exists an input for which insertion sort runs in $\Theta (n)$. It is not contradictory , however , to say that the worst case running time of insertion sort is Ω($n^{2}$) " .
Could anyone explain this line ?