title: Comparing two sorted int arrays
body: <p>I have millions of fixed-size (100) int arrays. Each array is sorted and has unique elements. For each array, I want to find all arrays which have 70% common elements. Right now I am getting around 1 million comparisons (using Arrays.binarySearch()) per second, which is too slow for us. </p>
  
  <p>Can anyone recommend a better searching algorithm?</p>