LinearSearch [线性搜索]
# 介绍
在计算机科学中，线性搜索或顺序搜索是一种寻找某一特定值的搜索算法，指按一定的顺序检查数组中每一个元素，直到找到所要寻找的特定值为止。是最简单的一种搜索算法。
# 原理
在计算机科学中，线性搜索或顺序搜索是一种寻找某一特定值的搜索算法，指按一定的顺序检查数组中每一个元素，直到找到所要寻找的特定值为止。是最简单的一种搜索算法。
# 实现
# JavaScript
/*
* Linear search or sequential search is a method for finding a target
* value within a list. It sequentially checks each element of the list
* for the target value until a match is found or until all the elements
* have been searched.
*/
function SearchArray (searchNum, ar, output = v => console.log(v)) {
const position = Search(ar, searchNum)
if (position !== -1) {
output('The element was found at ' + (position + 1))
} else {
output('The element not found')
}
}
// Search “theArray” for the specified “key” value
function Search (theArray, key) {
for (let n = 0; n < theArray.length; n++) {
if (theArray[n] === key) { return n }
}
return -1
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
# 参考
编辑 (opens new window)
上次更新: 2022/06/20, 20:15:04