is a step-by-step procedure forsolving a problem in afiniteamount of time.
Analysis of Algorithms2
Running Time (§1.1)
Most algorithms transforminput objects into outputobjects.The running time of analgorithm typically growswith the input size. Average case time is oftendifficult to determine.We focus on the worst caserunning time.
Easier to analyze
Crucial to applications such asgames, finance and robotics
best caseaverage caseworst case
Analysis of Algorithms3
Experimental Studies (§ 1.6)
Write a programimplementing thealgorithmRun the program withinputs of varying size andcompositionUse a method like
toget an accurate measureof the actual running timePlot the results