On Tue, Jun 16, 2015 at 12:27 AM, Rocky Bernstein <r...@dustyfeet.com> wrote: > In > http://stackoverflow.com/questions/30845469/time-complexity-of-python-set-intersection-for-n-sets/30845721#30845721 > it was noted that the time complexity for intersecting two sets is slightly > wrong and I'd like to fix that or have someone fix that. My account is > rockyb.
No probs! You have edit privileges. > O(min(len(s), len(t)) is applicable if the argument, t, is a set and not an > iterable. If it is an iterable, I think the "min" has to be changed to > "max". One might also consider adding information for intersecting multiple > sets. I honestly don't know about this part; you'll have to do your own verification to make sure this is indeed what it should say. But that's the beauty of a wiki... if you're wrong, someone else can fix it :) ChrisA _______________________________________________ pydotorg-www mailing list pydotorg-www@python.org https://mail.python.org/mailman/listinfo/pydotorg-www