algorithm analysis how long will it take to process the company payroll once we complete our planned mergershould buy new payroll program from vendor or vendor yif particular program is slowis it badly implemented or is it solving hard problemquestions like these ask us to consider the difficulty of problemor the relative efficiency of two or more approaches to solving problem this introduces the motivationbasic notationand fundamental techniques of algorithm analysis we focus on methodology known as asymptotic algorithm analysisor simply asymptotic analysis asymptotic analysis attempts to estimate the resource consumption of an algorithm it allows us to compare the relative costs of two or more algorithms for solving the same problem asymptotic analysis also gives algorithm designers tool for estimating whether proposed solution is likely to meet the resource constraints for problem before they implement an actual program after reading this you should understand the concept of growth ratethe rate at which the cost of an algorithm grows as the size of its input growsthe concept of upper and lower bounds for growth rateand how to estimate these bounds for simple programalgorithmor problemand the difference between the cost of an algorithm (or programand the cost of problem the concludes with brief discussion of the practical difficulties encountered when empirically measuring the cost of programand some principles for code tuning to improve program efficiency introduction how do you compare two algorithms for solving some problem in terms of efficiencyone way is to implement both algorithms as computer programs and then