Searching

function linearSearch(arr, el) {
    for (let i = 0; i < arr.length; i++) {
        if (arr[i] === el) {
            return i;
        }
    }

    return -1;
}

function binarySearch(arr, el) {
    if (arr.length <= 1) {
        return arr;
    }

    arr.sort();

    let left = 0;
    let right = arr.length - 1;

    while (left <= right) {
        const middle = Math.floor((left + right) / 2);

        if (arr[middle] === el) {
            return middle;
        }

        if (arr[middle] < el) {
            left = middle + 1;
        } else {
            right = middle - 1;
        }
    }

    return -1;
}