mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +08:00

* test: added for Linear Search Algorithm * Update Search/LinearSearch.js Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com> --------- Co-authored-by: Hridyanshu7 <himank7794@gmail.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
34 lines
898 B
JavaScript
34 lines
898 B
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.
|
|
*
|
|
* @see https://en.wikipedia.org/wiki/Linear_search
|
|
*/
|
|
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
|
|
}
|
|
|
|
export { SearchArray, Search }
|
|
|
|
// const ar = [1, 2, 3, 4, 5, 6, 7, 8, 9]
|
|
// SearchArray(3, ar)
|
|
// SearchArray(4, ar)
|
|
// SearchArray(11, ar)
|