let's the inputs be all natural numbers

answer in pseudo code

1. Double Vision in Sorted Array: The input is an array A[1..n] of n positive numbers sorted in increasing order. The problem is to determine whether there is a pair of indices i and j such that A[i] = 2A[j]. Design and analyze an O(n) time in-place algorithm for this