suppose two algorithms solving the same problem are availablean algorithm awhich has running time of ( )and an algorithm bwhich has running time of ( which algorithm is betterwe know that is ( )which implies that algorithm is asymptotically better than algorithm balthough for small value of nb may have lower running time than we can use the big-oh notation to order classes of functions by asymptotic growth rate our seven functions are ordered by increasing growth rate in the sequence belowthat isif function (nprecedes function (nin the sequencethen (nis ( ( )) log nlog we illustrate the growth rates of some important functions in figure table selected values of fundamental functions in algorithm analysis logn nlogn