dimitrios apostolou geefogmxnet hello guido van rossum wrote well hit nail head document actual guaranteed expression think worms better left unopened best include hints open say average case complexity important example sorting onlogn dict lookup o1 worst case important would nice necessary extra column table information blank applicable clarify random access list tuple elements constant time cpython dicts sets implemented using hash table open hashing readers draw conclusions notes nice already exist random places huge documentation archive still believe best place already existing tables docs pointed initial post one trivially able find information hand notes could added various oddities according experience example sets 10 elements list would probably better hashing overhead implementations becomes quality implementation issue agree cpython docs document cpython behaviour would helpful someone writing program cpython people use implementations consult appropriate docs implementors worst algorithms try reach cpython efficiency regarding ops need kind information deciding various standard data types would recommend different approach pick data type produces shortest code likelihood also efficient hmmm first thing comes mind prepending item list small seems nice think besides someone cares code good looks enough thanks answers dimitris _______________________________________________ pythondev mailing list zvlllneumpythonorg httpmailpythonorgmailmanlistinfopythondev unsubscribe httpmailpythonorgmailmanoptionspythondevpythondev40tangomucom wed 06 aug 2008 081954 0200 pythondev complexity documentation request