functionsequentialSearch(item, array){for(let i =0; i < array.length;i++){if(item === array[i]){return i
}}return-1}
console.log(sequentialSearch(2,[3,2,4,5,3]))
二分搜索
// function quickSort()functionbinarySearch(item, array){// 这里使用了快速排序先对数组进行排序let sortArray =quickSort(array)let low =0, hight = sortArray.lenght -1, mid, element
while(low < high){
mid = Math.floor((low + high)/2)
element = sortArray[mid]if(element < item){
low = mid +1}elseif(element > item){
high = mid -1}else{return}}}binarySearch(13,[13,8,15,9,5,12,11])