This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author rhettinger
Recipients mark.dickinson, rhettinger, scoder, serhiy.storchaka, skrah, steven.daprano, tim.peters
Date 2018-07-30.04:23:56
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <1532924636.78.0.56676864532.issue33089@psf.upfronthosting.co.za>
In-reply-to
Content
I really don't want to introduce something slower than O(n) behavior here, particularly because some of my use cases have a large n and because this will be called many times.  Tim has already opined the even using a variant of Kahan summation would increase the cost unacceptably. IMO, sorting is even worse and would be a foolish thing to do.
History
Date User Action Args
2018-07-30 04:23:56rhettingersetrecipients: + rhettinger, tim.peters, mark.dickinson, scoder, steven.daprano, skrah, serhiy.storchaka
2018-07-30 04:23:56rhettingersetmessageid: <1532924636.78.0.56676864532.issue33089@psf.upfronthosting.co.za>
2018-07-30 04:23:56rhettingerlinkissue33089 messages
2018-07-30 04:23:56rhettingercreate