Search.java

/**
* Find element position in sorted int array using binary search.
* Time- O(long n) Space- C
*/
static int binSearch(int[] A, int k) {
  int l = 0;
  int u = A.length - 1;
  int m;
  
  while (l <= u) {
    m = l + (u - l) / 2;
    if(A[m] < k) {
      l = m + 1;
    } else if(A[m] == k) {
      return m;
    } else {
      u = m - 1;
    }
  }
  return -1;
}

SquareRootSearchProblem.java

/**
* Functio to search the square root of given unsinged int.
* Input: unsined 32-bit int.
*/
static int squareRootSearch(int k) {
        int l = 0;
        int u = 65536;
        int m;

        while (l + 1 < u) {
            m = l + (u - l) / 2;
            int mSquare = m * m;
            if(k > mSquare) {
                l = m;
            } else if (k == mSquare) {
                return m;
            } else {
                u = m;
            }
        }

        return l;
    }