Given an array consisting of n sorted distinct integers followed by an infinite sequence of co values, design the most efficient algorithm to determine the position of the first co. Find the recurrence relation for the algorithm and solve it using the iteration method.