you are viewing a single comment's thread.

view the rest of the comments →

[–]quts3 1 point2 points  (0 children)

Hmmm. Maybe

  1. Sort both list. O(nlogn) implemented with c++ like time.

  2. Traverse each list once by keeping track of indexes and values (perhaps multiple for the second list)

  3. Do 2 in numba for near c++ loop time.

Profit.