computational complexity because the time to access an element does not depend on nwe can pick ( sowe say that the average time to access an element in list of size is ( if we assume it never takes longer than us to access an element of list in pythonthen good choice for would be according to the definition above then it must be the case that (nis less than or equal to once gets big enough the choice of ( is arbitrary in computing the complexity of accessing an element of list we could have chosen ( if ( were chosend might be chosen to be instead of butsince we are only concerned with the overall growth in the function gthe choice of or is irrelevant and the simplest function is chosenin this case ( in englishwhen an operation or program is ( )we say it is constant time operation or program this means the operation does not depend on the size of it turns out that most operations that computer can perform are ( for instanceadding two numbers together is ( operation so is multiplication of two numbers while both operations require several cycles in computerthe total number of cycles does not depend on the size of the integers or floating point numbers being added or multiplied cycle is simply unit of time in computer comparing two values is also constant time operation when computing complexityany arithmetic calculation or comparison can be considered constant time operation this idea of computational complexity is especially important when the complexity of piece of code depends on in the next section we'll see some code that depends on the size of the list it is working with and how important it is that we understand the implications of how we write even small piece of code the pylist append operation we have established that accessing memory location or storing value in memory location is ( )or constant timeoperation the same goes for accessing an element of list or storing value in list the size of the list does not change the time needed to access or store an element and there is fixed upper bound for the amount of time needed to access or store value in memory or in list with this knowledgelet' look at the drawing program again and specifically at the piece of code that appends graphics commands to the pylist this code is used lot in the program every time new graphics command is createdit is appended to the sequence when the user is doing some free-hand drawinghundreds of graphics commands are getting appended every minute or so since free-hand drawing is somewhat compute intensivewe want this code to be as efficient as possible this copy belongs to 'acha