DSA using JavaScript

Time Complexity: O(n)
Space Complexity: O(1)

Binary Search

function linearSearch(nums, target) {
    for (let i = 0; i < nums.length; i++) {
        if (nums[i] === target) {
            return i;
        }
    }
    return -1;
}

const nums = [1, 2, 3, 4, 5];
const target = 3;
console.log(linearSearch(nums, target));  // Output: 2

function binarySearch(nums, target) {
    let left = 0;
    let right = nums.length - 1;

    while (left <= right) {
        let mid = Math.floor((left + right) / 2);
        
        if (nums[mid] === target) {
            return mid;
        } else if (nums[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }
    
    return -1;
}

const nums = [1, 2, 3, 4, 5];
const target = 3;
console.log(binarySearch(nums, target));  // Output: 2