is there anything faster than maxloc for a sort vector

[rodrigo_acj]

I have to find the greater number in a sorted vector (descending) with a condition (e.g. .LT. ), is there anything faster than maxloc to do it? Equivalently, i'd like to find the first element in a vector thatcomply acondition, e.g. x.EQ.5

[JVanB]

Given that the vector is already sorted, a binary search ought to converge to the appropriate index rapidly.

[rodrigo_acj]

thnx, i'll prove it