KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
In Python you can get the intersection of two sets doing: >>> s1 = {1, 2, 3, 4, 5, 6, 7, 8, 9} >>> s2 = {0, 3, 5, 6, 10} >>> s1 & s2 set([3, 5, 6]) >>> s1.intersection(s2) set([3, 5, 6]) Anybody knows the complexity of this intersection ( & ) algorithm? EDIT: In addition, does anyone know what is the data structure behind a Python set?
Tags (comma-separated)
Save Edits
Cancel