Message322651
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. |
|
Date |
User |
Action |
Args |
2018-07-30 04:23:56 | rhettinger | set | recipients:
+ rhettinger, tim.peters, mark.dickinson, scoder, steven.daprano, skrah, serhiy.storchaka |
2018-07-30 04:23:56 | rhettinger | set | messageid: <1532924636.78.0.56676864532.issue33089@psf.upfronthosting.co.za> |
2018-07-30 04:23:56 | rhettinger | link | issue33089 messages |
2018-07-30 04:23:56 | rhettinger | create | |
|