>Terry,
>
>I'm disappointed! :-)
>
>Rather than a FOR loop, if you're searching an ordered array or list, a DO WHILE construct for a binary search is faster than a sequenctial search. That's what both a FOR loop or ASCAN() would use.

George

I'm so sorry :-C. I guess I did commit that message b4 reading your argument (it was yours, wasn't it?) that the time differences don't add up to a hill of beans. And then I said only if a huge list that would take seconds rather than fractions thereof. I'm, of course, interested in what you just said. What exactly do you mean by "binary search"? As I learnt it in college it means going backward and foreward in the list, halving the distance as you go (in essence). If that's so, please could you indicate how does ascan() do it, and how you would do it via a do while?

Cheers

Terry