Modified Binary Search Algorithm

Attempt

function modifiedBinarySearch(nums, target) {
  /**
  * Along with updating the left, right and mid pointers, it has to be checked if the elements on left and right side smaller and greater than mid element 
  *
  **/
 let l = 0;
 let r = nums.length;
 let mid = l + r // 2;
 for (let i=0; i< nums.length; i++) {
  mid = l + r // 2;
  if (mid < target) {
    l = mid;
  } else if ( mid > target)
    r = mid;
 } else if ( target == mid) {
    return mid;
 }
 
return -1;
 
}