Usually the base is always less than 4. So for higher values n, n*log(n) becomes greater than n. And that is why O(nlogn) > O(n). Log(n) can be greater than 1 if n is greater than b. But this doesn't answer your question that why is O(n*logn) is greater than O(n)....