I thought about that, but logically, it seems like that would take more
time. My reason is this:

For each element in the first array that I'm trying to match -
I'd have to take the entire second array and go back and forth several
times until if found a number that matched - then I still have to
figure out how many items above and below are equal to that value.

The way I'm doing it - since my arrays are both sorted and I know that
every element in the first array appears in the second (and maybe
multiple times in the first as well)
- by resetting the starting point each time through to be progressively
higher and higher and then bypassing any calc's when it hits a maximum,
I'd think that would be faster

wrote:

I thought about that, but logically, it seems like that would take more
time. My reason is this:

For each element in the first array that I'm trying to match -
I'd have to take the entire second array and go back and forth several
times until if found a number that matched - then I still have to
figure out how many items above and below are equal to that value.

The way I'm doing it - since my arrays are both sorted and I know that
every element in the first array appears in the second (and maybe
multiple times in the first as well)
- by resetting the starting point each time through to be progressively
higher and higher and then bypassing any calc's when it hits a maximum,
I'd think that would be faster

I posted in the "Still having Application.Match trouble" thread.

Alan Beban