Binary Search LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @param {number} target
4
 * @return {number}
5
 */
6
var search = function (nums, target) {
7
  let low = 0;
8
  let high = nums.length - 1;
9

10
  if (target < nums[0] || target > nums[high]) {
11
    return -1;
12
  }
13

14
  while (low <= high) {
15
    mid = Math.floor((low + high) / 2);
16

17
    if (nums[mid] == target) {
18
      return mid;
19
    } else {
20
      if (target > nums[mid]) {
21
        low = mid + 1;
22
      } else {
23
        high = mid - 1;
24
      }
25
    }
26
  }
27

28
  return -1;
29
};