In the 3rd lecture of Wednesday, it was said that for bubble sort, lower bound or omega will be 'n'.
But shouldn't it be (n-1)? Suppose if list to sort is (1, 2, 3, 4) then it would take me 3 comparisons to identify that this is a already sorted list.
No? If correct me if I am missing something.