GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Search/LinearSearch.js at master · hackingstaar/JavaScript Expand file tree/ Copy pathLinearSearch.jsMore file actions 33 lines (30 loc) · 898 Bytes / Copy pathLinearSearch.jsFile metadata and controls33 lines (30 loc) · 898 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 32 33 /* * 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) |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |