forked from TheAlgorithms/JavaScript
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinearSearch.js
More file actions
Latest commit
31 lines (28 loc) · 843 Bytes
/
Copy pathLinearSearch.js
File metadata and controls
31 lines (28 loc) · 843 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
/*
* 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.
*/
functionSearchArray(searchNum,ar,output=(v)=>console.log(v)){
constposition=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
functionSearch(theArray,key){
for(letn=0;n<theArray.length;n++){
if(theArray[n]===key){
returnn
}
}
return-1
}
export{SearchArray,Search}
// const ar = [1, 2, 3, 4, 5, 6, 7, 8, 9]
// SearchArray(3, ar)
// SearchArray(4, ar)
// SearchArray(11, ar)