Get Time
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat (newest first)  | Threaded  | Tree
Previous Thread  |  Next Thread
Doubt! | Reply
I was going through the article and I found this.

47N log N = O(N^2).

Just wondering, should this not be O(N log N)? Can someone explain why it is O(N^2)?
Re: Doubt! (response to post by SystemCall) | Reply
Repeating from the tutorial, O(N^2) just says that the given function is at most quadratic. You can think of that as just an upper bound. It need not be the least upper bound. Therefore, it is correct to say that 47N log N =O(N^3), O(N^4),...