Skip to content

abhaykrishnanmn/Linear-Search

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

Linear-Search

Implementation of searching algorithms linear search

Algorithm:

Step 1: Select the first element as the current element.

Step 2: Compare the current element with the target element. If matches, then go to step 5.

Step 3: If there is a next element, then set current element to next element and go to Step 2.

Step 4: Target element not found. Go to Step 6.

Step 5: Target element found and return location.

Step 6: Exit process.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages