algorithm analysis are characterized by time-complexity of (nm since the dominant term is the highest power of the most common polynomial algorithms are linear ( )quadratic ( )and cubic ( an algorithm whose efficiency is characterized by dominant term in the form an is called exponential exponential algorithms are among the worst algorithms in terms of time-complexity evaluating python code as indicated earlierwhen evaluating the time complexity of an algorithm or code segmentwe assume that basic operations only require constant time but what exactly is basic operationthe basic operations include statements and function calls whose execution time does not depend on the specific values of the data that is used or manipulated by the given instruction for examplethe assignment statement is basic instruction since the time required to assign reference to the given variable is independent of the value or type of object specified on the righthand side of the sign the evaluation of arithmetic and logical expressions done and are basic instructionsagain since they require the same number of steps to perform the given operations regardless of the values of their operands the subscript operatorwhen used with python' sequence types (stringstuplesand listsis also basic instruction linear time examples nowconsider the following assignment statementy ex (nan assignment statement only requires constant timebut that is the time required to perform the actual assignment and does not include the time required to execute any function calls used on the righthand side of the assignment statement to determine the run time of the previous statementwe must know the cost of the function call ex (nthe time required by function call is the time it takes to execute the given function for exampleconsider the ex (functionwhich computes the sum of the integer values in the range [ )def ex )total for in rangen total + return total