Binary Search leetcode

Binary Search leetcode.ts

function search(nums: number[], target: number): number {
let left=0;
      let right=nums.length-1
   while (left <= right) {
 const middle = Math.floor((left + right) / 2);
 const potentialMatch = nums[middle];
 if (target === potentialMatch) {
 return middle;
 } else if (target < potentialMatch) {
 right = middle - 1;
 } else {
 left = middle + 1;
 }
 }
 return -1;}