I hate big O so much!!!!! It's sooooo head to determine the worse case. And in the other csc class we need to find the worse case running time for our code. It's so hard to see. Also for the O(m + n) and O(m(log(n))), it's not very easy which one is better.
Also I am confused about big O and big Omega. Is the one is the worst case and the other one is the best case. Those two things made me carzy.
For the last assignment, can a function is both in Big O and big omega of other function?