Write a binary search program

Input: An array in ascending order, array length, and specified value.

Output: Position of the given value in the sequence

The principle of binary search is clear, and the key is to writeProgramWhen the boundary conditions are grasped, This is the focus of the interviewer's investigation.

Int bisearch (int A [], int Len, int p) {int L = 0; int u = len-1; while (L <= U) {int M = L + (u-l)/2; if (a [m] <p) L = m + 1; // ensure that the problem domain is reduced during each iteration, else if (a [m]> P) u = m-1; // This is the key else return m ;} return-1 ;}