在数组中查找数组的有效方法是什么？

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

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

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

function hashTableSearch(arr, target) {
    const hashMap = new Map();
    for (let i = 0; i < arr.length; i++) {
        hashMap.set(arr[i], i);
    }
    return hashMap.has(target) ? hashMap.get(target) : -1;
}