title: Is n log n = O(n) and is n log n = Omega(n)
body: <p>Hey guys i have been asked the above 2 questions with an explanation as to why. I'm quite confused, i know that the time it takes for an O(nlogn) algorithm to run grows faster then a linear O(n) algorithm but not quite sure the answer to these.
  I'm fairly sure that n log n is not equivalent to O(n) but im not quite sure how to explain it. (i don't think we need to do an exact proof)</p>