python data structures the efficiency and accuracy of algorithms have to be analysed to compare them and choose specific algorithm for certain scenarios the process of making this analysis is called asymptotic analysis it refers to computing the running time of any operation in mathematical units of computation for examplethe running time of one operation is computed as (nand may be for another operation it is computed as ( this means the first operation running time will increase linearly with the increase in and the running time of the second operation will increase exponentially when increases similarlythe running time of both operations will be nearly the same if is significantly small usuallythe time required by an algorithm falls under three typesbest case minimum time required for program execution average case average time required for program execution worst case maximum time required for program execution asymptotic notations the commonly used asymptotic notations to calculate the running time complexity of an algorithm are as followso notation notation th notation big oh notationo the notation (nis the formal way to express the upper bound of an algorithm' running time it measures the worst case time complexity or the longest amount of time an algorithm can possibly take to complete for examplefor function (