Hi folks, i need some help on binary search... a much complex one...

I have a sorted list array which contain keys from 2 different arrays.... name it A1 and A2

My binary search would be seem easy if i search with respect to just the sorted list. BUT the binary search is dynamic in the sense that......... i can select to search with respect to A1, A2 or both.

One very important question is how to skip the non-selected array elements in the while loop, manipulation of the start, end and pivot???

I don't need code, just some pointers.....comments...

I am not using the recursion version. Just the while loop version.

Thanks in adanve!!