2017-08-17 11:10:10 +05:30
|
|
|
/*
|
2019-06-27 10:41:44 -04:00
|
|
|
* 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.
|
|
|
|
|
*/
|
2021-10-11 15:11:52 +02:00
|
|
|
function SearchArray (searchNum, ar, output = v => console.log(v)) {
|
2021-05-21 11:16:11 +05:30
|
|
|
const position = Search(ar, searchNum)
|
2020-05-04 18:57:53 +05:30
|
|
|
if (position !== -1) {
|
2021-10-11 15:11:52 +02:00
|
|
|
output('The element was found at ' + (position + 1))
|
2021-10-11 15:49:24 +02:00
|
|
|
} else {
|
2021-10-11 15:11:52 +02:00
|
|
|
output('The element not found')
|
2020-05-03 09:05:12 +02:00
|
|
|
}
|
2017-08-17 11:08:36 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Search “theArray” for the specified “key” value
|
2020-05-03 09:05:12 +02:00
|
|
|
function Search (theArray, key) {
|
2021-05-21 11:16:11 +05:30
|
|
|
for (let n = 0; n < theArray.length; n++) {
|
2020-05-04 18:57:53 +05:30
|
|
|
if (theArray[n] === key) { return n }
|
2020-05-03 09:05:12 +02:00
|
|
|
}
|
|
|
|
|
return -1
|
2017-08-17 11:08:36 +05:30
|
|
|
}
|
|
|
|
|
|
2021-10-11 12:29:03 +02:00
|
|
|
export { SearchArray, Search }
|
|
|
|
|
|
|
|
|
|
// const ar = [1, 2, 3, 4, 5, 6, 7, 8, 9]
|
|
|
|
|
// SearchArray(3, ar)
|
|
|
|
|
// SearchArray(4, ar)
|
|
|
|
|
// SearchArray(11, ar)
|
