This a general question and I need help again Perl Monks. I have a series of functions that I need to analyse in order to run them thru a perl program and I'm trying to make them into the Big O notation to see which one will be more efficient. The functions are
2log(n)+n^2log(log(n))&
3loga(n)+2logb(n) #where a and b and the bases of the logarithm