On Fri, Sep 20, 2019 at 5:08 AM Richard Higginbotham <higgi...@gmail.com> wrote: > > Its faster than the built in set type. Uniqueness of values isn't a > requirement. The values need to be comparable so that they can be sorted. > This allows a linear time complexity. >
Note that the linear time complexity assumes that they have *already* been sorted (not just that they *can be* sorted), as otherwise the process will incur an O(n log n) sort step first. ChrisA _______________________________________________ Python-ideas mailing list -- python-ideas@python.org To unsubscribe send an email to python-ideas-le...@python.org https://mail.python.org/mailman3/lists/python-ideas.python.org/ Message archived at https://mail.python.org/archives/list/python-ideas@python.org/message/C4SEBWX6TZF6AV3ASO6ZMKAXK5LYEZDX/ Code of Conduct: http://python.org/psf/codeofconduct/
