In this article, we try to learn how to conduct a linear search in JavaScript, what is linear search with an example, what is meant by linear search, Linear Search in JavaScript, global Linear Search, An Implementation of Linear Search in JavaScript, what is Linear Search in JavaScript, and what is linear search in JavaScript.
What is Linear Search in JavaScript
Firstly, we need to know what is linear search in JavaScript, the Linear Search algorithm is a set of instructions to traverse the given list and also check every element in the list until we will find whatever element we are looking for.
Previous JavaScript Articles
- JavaScript Variables
- JavaScript Operators
- Creating an Object in JavaScript
- Introduction to Asynchronous JavaScript
- Control Flow in JavaScript
- What is JavaScript Regex?
- JavaScript Events Example
- How to create a preloader in JavaScript?
- forEach method in JavaScript
- Sorting Arrays in JavaScript
So, a technical term for the element we are looking for is – key.
If you want then buy a good, reliable, secure web hosting service from here: click here
If we get the element, we will return the position of the element and if the element we are looking for does not exist in the list, we actually return -1.
An Implementation of Linear Search in JavaScript
Now, we can cross through the given list using a for loop. Go below to check the implementation of the Linear Search example:
function linearSearch(arr, key){
for(let i = 0; i < arr.length; i++){
if(arr[i] === key){
return i
}
}
return -1
}
Although, in this case, the element doesn’t exist in our list, the linearSearch function won’t return any i value from the loop and we return -1 after the loop to show that the function did not find the desired element.
Global Linear Search
Now, in the previous implementation, we can return a value after we come across the first occurrence of the element we are looking for (key). But what if we want the indices of all the occurrences of a given element?
You can purchase your hosting from Cloudsurph.com, Cloudsurph hosting is a reliable hosting option for business and personal projects. We offer insight and help on system configuration issues and code errors or bugs.
So, look at the example below for the implementation of the global linear search:
function globalLinearSearch(arr, key){
let results = []
for(let i = 0; i < arr.length; i++){
if(arr[i] === key){
results.push(i)
}
}
// If results array is empty, return -1
if(!results){
return -1
}
return results
}
Finally, we implemented the algorithm in JavaScript and we have seen the logic behind linear search and then used that knowledge. Also, we looked at the time complexity for the linear search algorithm.
That’s it. If you enjoyed reading this article and have more questions please reach out to our support team via live chat or email and we would be glad to help you. we provide server hosting for all types of need and we can even get your server up and running with the service of your choice.