two algorithm analysis objectives to understand why algorithm analysis is important to be able to use "big-oto describe execution time to understand the "big-oexecution time of common operations on python lists and dictionaries to understand how the implementation of python data impacts algorithm analysis to understand how to benchmark simple python programs what is algorithm analysisit is very common for beginning computer science students to compare their programs with one another you may also have noticed that it is common for computer programs to look very similarespecially the simple ones an interesting question often arises when two programs solve the same problem but look differentis one program better than the otherin order to answer this questionwe need to remember that there is an important difference between program and the underlying algorithm that the program is representing as we stated in an algorithm is genericstep-by-step list of instructions for solving problem it is method for solving any instance of the problem such that given particular inputthe algorithm produces the desired result programon the other handis an algorithm that has been encoded into some programming language there may be many programs for the same algorithmdepending on the programmer and the programming language being used to explore this difference furtherconsider the function shown below this function solves familiar problemcomputing the sum of the first integers the algorithm uses the idea of an accumulator variable that is initialized to the solution then iterates through the integersadding each to the accumulator def sum_of_n( )the_sum for in range( , + )