Programming

An array a contains n integers in non-decreasing order, A[1] ≤ A[2] ≤ … ≤ A[n]. Describe, using Pascal like pseudo code, a linear time algorithm to find i, j, such that A[i] + A[j] = a given integer M, if such i, j exist.