>George,
>
>>I should have said "up to four times" (actually about 3.9, but I rounted it up. What I've listed below is the test code I used.
>Thanks. Shouldn't this be permanently written up and posted here?

I don't know. To me, this is a very fundamental algorithm. Further, it does have limited usefulness. However, I believe that there are situations where it does have some utility. Got a large ordered array? It's faster than ASCAN()? Got a large ordered list? You can't search it any faster. A table with an index? Nope, can't beat SEEK, but then again, if the table is ordered and it doesn't have an index...I do think that to some degree, given the power of VFP, we tend to forget about something like this. My original post was just a reminder< g >