Skip to content

Added Linear Search Algorithm in C #48

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
imCHiGi wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Added Linear Search Algorithm in C #48

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions searching_algorithms/LinearSearch.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@

# Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found.
# Time complexity: O(N)


void linearSearch(int arr[], int n, int search)
{
int i;
for (i = 0; i < n; i++)
{
if (arr[i] == search)
{
printf("Element found at location: %d\n", i + 1);
break;
}
}
if (i == n)
{
printf("Not Found!\n");
}
}