An algorithm problem

I want to find a function f(n) that is both O(n) and O(nlogn). I think f(n) can be f(n) = n. Is that true?

Quote:

---

Originally Posted by bMorgan

I want to find a function f(n) that is both O(n) and O(nlogn). I think f(n) can be f(n) = n. Is that true?

---

if O(n) == O(n*log(n)) then O(1) == O(log(n)).

kind regards,

Jos