We present a probabilistic algorithm that in the black-box model performs a search in an ordered list using 3/4 log N + O(1) queries, whereas classically, log N - O(1) is the best that can be achieved. Moreover, our algorithm does not rely on the Hadamard nor on the discrete Fourier transform.