Linear Search(Sequential Search線性搜尋法)

Worst Performance O(n) Best Performance O(1) Average Performance O(n/2)


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


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