Question: Please explain clearly in pseudocode only, I'm having trouble making this algorithm in O(n) time. Write an O(n) algorithm that receives as input an array

Please explain clearly in pseudocode only, I'm having trouble making this algorithm in O(n) time.
Write an O(n) algorithm that receives as input an array A of n real numbers sorted in nondecreasing order and a value, val. The algorithm returns true if there are distinct indexes i and j such that a[i]+a[j]=val and false otherwise
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
