Efficient list intersection algorithm

by

You could put all elements of the first list into a hash set. Then, iterate the second one and, for each of its elements, check the hash to see if it exists in the first list. If so, output it as an element of the intersection.

More Related Contents:

  1. Algorithm to generate all possible permutations of a list?
  2. Computing set intersection in linear time?
  3. Efficiently selecting a set of random elements from a linked list
  4. Complexity of absolute difference and sum
  5. Efficient way to add element to sorted datastructure [closed]
  6. What is tail recursion?
  7. Algorithm for finding the fewest rectangles to cover a set of rectangles without overlapping
  8. Getting the closest string match
  9. How do you detect Credit card type based on number?
  10. How to compute Discrete Fourier Transform?
  11. How does finding a cycle start node in a cycle linked list work?
  12. find all subsets that sum to a particular value
  13. Need help in mod 1000000007 questions
  14. What is Constant Amortized Time?
  15. SICP example: Counting change, cannot understand
  16. How can I compute a Cartesian product iteratively?
  17. Quicksort: Iterative or Recursive
  18. How best to sum up lots of floating point numbers?
  19. Polygon enclosing a set of points
  20. Algorithm to mix sound
  21. finding a^b^c^… mod m
  22. Algorithm to find the most common substrings in a string
  23. Sorting a sequence by swapping adjacent elements using minimum swaps
  24. Optimizing Conway’s ‘Game of Life’
  25. Retrieving the top 100 numbers from one hundred million of numbers [duplicate]
  26. What is password hashing? [closed]
  27. Can an array be grouped more efficiently than sorted?
  28. Why are hash table expansions usually done by doubling the size?
  29. Find local minimum in n x n matrix in O(n) time
  30. What is the difference between Linear search and Binary search?

Leave a Comment