As title. Is it faster for inplace sorting, or simply the
implementation of list.sort() was done before the implementation of
timsort?
_______________________________________________
Python-Dev mailing list -- python-dev@python.org
To unsubscribe send an email to python-dev-le...@python.org
https://mail.python.org/mailman3/lists/python-dev.python.org/
Message archived at 
https://mail.python.org/archives/list/python-dev@python.org/message/HTSJ7K4GYFZ2P6XUIQYDOTDAGCJDXJH6/
Code of Conduct: http://python.org/psf/codeofconduct/

Reply via email to