1low = 0, high = n-1
2while low <= high and target >= arr[low] and target <= arr[high]:
3 pos = low + ((target - arr[low]) * (high - low) / (arr[high] - arr[low]))
4 if arr[pos] == target: return pos
5 if arr[pos] < target: low = pos + 1
6 else: high = pos - 1
7return -1
No pseudocode line selected.