For simplicity I say I have 2 1-based 1-D arrays, both holding integer
numbers.
Both arrays are sorted ascending.
Would there be any faster way to determine that both arrays have no numbers
in common other than with a double loop? As these arrays can be big
(thousands)
this could take a minute or so.
I don't know C++ or Assembly, but that are the kind of things I am thinking
of.
Thanks for any advice.

RBS