What’s the algorithm of ‘set.intersection()’ in python?

by

The algorithm is as follows: the smaller set is looped over and every element is copied depending whether it’s found in the bigger set. So, it’s the C equivalent of

def intersect(a, b):
    if len(a) > len(b):
        a, b = b, a

    c = set()
    for x in a:
        if x in b:
            c.add(x)
    return c

(Or: return set(x for x in a if x in b).)

More Related Contents:

  1. Removing duplicates in lists
  2. Best way to find the intersection of multiple sets?
  3. Python -Intersection of multiple lists?
  4. Find sets of disjoint sets from a list of tuples or sets in python
  5. A set union find algorithm
  6. Python: powerset of a given set with generators [duplicate]
  7. Find non-common elements in lists
  8. How do i implement these algorithms below
  9. Find intersection of two nested lists?
  10. How to “perfectly” override a dict?
  11. How to efficiently compare two unordered lists (not sets) in Python?
  12. Approximating data with a multi segment cubic bezier curve and a distance as well as a curvature contraint
  13. How to JSON serialize sets?
  14. Weighted random selection with and without replacement
  15. Intersection of two graphs in Python, find the x value
  16. Efficient calculation of Fibonacci series
  17. How did Python implement the built-in function pow()?
  18. Mapping a range of values to another
  19. How to compare a list of lists/sets in python?
  20. How to check whether two lists are circularly identical in Python
  21. How to test if one string is a subsequence of another? [duplicate]
  22. Fast prime factorization module
  23. Finding the intersection between two series in Pandas
  24. How to incrementally sample without replacement?
  25. Replace list of list with “condensed” list of list while maintaining order
  26. python order of elements in set
  27. Is set.pop() deterministic?
  28. How can I interleave or create unique permutations of two strings (without recursion)
  29. Generate all subsets of size k (containing k elements) in Python
  30. counting combinations and permutations efficiently

Leave a Comment