Search a sorted array by checking every j^th item until the right area is found, then doing a linear search. The optimum for n items is when j=√ n.