Is iterating through a list faster than iterating through a set?

Asked May 29 '20 at 08:48

Active May 29 '20 at 09:06

Viewed 57 times

This is maybe a dumb question, but I was just wondering, is iterating through a set as fast as iterating through a list in python if their length was n? I'm guessing that getting an item from a set is not the same as a list.

for example:

set = {1, 4, 6, 8}
list = ['a', 'b', 'c', 'd']

asked May 29 '20 at 08:48

Ikkjo

5

Does this answer your question? [Python Sets vs Lists](https://stackoverflow.com/questions/2831212/python-sets-vs-lists) – bherbruck May 29 '20 at 08:50
was going to comment the same, that is already answered somewhere – E.Serra May 29 '20 at 08:51
see here: https://stackoverflow.com/questions/2831212/python-sets-vs-lists remember you can't have duplicate values in a set – bherbruck May 29 '20 at 08:51
2

@TenaciousB *iterating* through a set is not faster, membership testing in a set is faster. – juanpa.arrivillaga May 29 '20 at 08:51
Did you try and see? use the `timeit` module. – juanpa.arrivillaga May 29 '20 at 08:52
@SergeBallesta I re-opened, the linked duplicate doesn't address iteration speed over both the containers. – juanpa.arrivillaga May 29 '20 at 09:06
@juanpa.arrivillaga: No problem. But are you sure that this answer https://stackoverflow.com/a/17945009/3545273 does not address it? (No doubt that the accepted answer does not, so re-opening can make sense anyway) – Serge Ballesta May 29 '20 at 09:13
@TenaciousB yes, exactly! Thank you for the link! – Ikkjo May 30 '20 at 09:30

Is iterating through a list faster than iterating through a set?

0 Answers0