XP is just a number  
PerlMonks 
Re^2: Big O notationby jettero (Monsignor) 
on Oct 14, 2011 at 16:37 UTC ( #931553=note: print w/replies, xml )  Need Help?? 
You could use a graphing calculator to show that's probably not true. n^2 log(n) will grow faster than log(n), as will n^2, so surely O(log(n)) can't be an upper bound for something that has n^2 log(n) in it. Maybe it was supposed to be n^(2 * log(n)) ... can't really tell. Probably homework anyway. update: lol, figured
In Section
Seekers of Perl Wisdom

