Repository navigation
Is there a more efficient approach than Python's built-in set.intersection() for handling millions of elements? #15737
Replies: 1 comment
|
Python's built-in set.intersection() is already highly optimized. However, performance can improve by processing the smallest set first. For sorted data, a two-pointer algorithm can achieve O(N + M) complexity. For large integer datasets, Roaring Bitmaps are also worth considering. |
0 replies
Answer selected by
codehaven712
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Python's built-in set.intersection() is already highly optimized. However, performance can improve by processing the smallest set first. For sorted data, a two-pointer algorithm can achieve O(N + M) complexity. For large integer datasets, Roaring Bitmaps are also worth considering.
IS THAT true?