Hi - 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.
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. Thanks.
_______________________________________________ pydotorg-www mailing list pydotorg-www@python.org https://mail.python.org/mailman/listinfo/pydotorg-www
