DAY5 - Binary Search - has square root

hasSqrt.js

function hasSqrt(N) {
  let L = 0;
  let R = N;
  while (L <= R) {
    let mid = Math.floor(L + (R - L) / 2);
    let sqare = Math.pow(mid, 2);
    if (sqare === N) {
        return true;
    } else if (sqare < N) {
        L = mid + 1;
    } else {
        R = mid - 1;
    }
  }
  return false;
}