operation indexx[index assignment append pop(pop(iinsert( ,itemdel operator iteration contains (inget slice [ :ydel slice set slice reverse concatenate sort multiply big- efficiency ( ( ( ( (no(no(no(no(no(ko(no( ko(no(ko( log no(nktable big- efficiency of python list operators times it is also important to point out that the list is decreasing in size by each time through the loop but since the initial list is two million elements in size we only reduce the overall size by pop_zero timer(" pop( )""from __main__ import "pop_end timer(" pop()""from __main__ import " list(range( )pop_zero timeit(number= list(range( )pop_end timeit(number= while our first test does show that pop( is indeed slower than pop()it does not validate the claim that pop( is (nwhile pop(is ( to validate that claim we need to look at the performance of both calls over range of list sizes pop_zero timer(" pop( )""from __main__ import "pop_end timer(" pop()""from __main__ import "print("pop( pop()"for in range( , , ) list(range( )pt pop_end timeit(number= list(range( ) performance of python data structures