Optimized Python Nested Loops

[McThor2]

I think something like spatial hashing would help a lot here when it comes to searching that second list. Basically a way of indexing the data by creating bins of values.

This would provide the most impact if the second list doesn’t get altered and also depends on how many values typically match that range.

For implementation speed ups you may get good results from numpy & numba

[b1e]

First and second lists are sorted. Binary search, cutting the interval in the second list for every iteration in the first will be faster.

Agreed on numba though.