Hi Walter,

>I really love those challenges. Though I also have one that uses recursion, the following seems to be most effective (And readable).
>
I won't argue readability here, since it is to a large account a
matter of personal preference and self-training <g>.

The "problem" with this approach is, that on increasingly large array's
the first case will possibly be evaluated quite often to being untrue.

In vfp I try to order the cases according to expected frequency, and that
puts this case last. Also there is an added check in the do while...

"My" favorite (including softseek, but that could be included here as well)
is in the answer to George.

Regards

thomas