Skip to content

Implemented Linear search #23

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
PragyaPR06 wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Implemented Linear search #23

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
36b8bc4
Implemented Linear search
Apr 1, 2023
0d41ee3
Merge branch 'main' into main
PragyaPR06 Apr 1, 2023
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
23 changes: 17 additions & 6 deletions linear-search.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,10 +1,18 @@
#include <stdio.h>
void display()
{
// display code goes here
void display(int i)
{
int index=i;
printf("%d",index);
}
int linearSearch(int search,int n,int arr[])

int linearSearch(int arr[],int key,int n)
{
for(int i=0;i<n;i++){
if(arr[i]==key){
display(i);
}else
display(-1);
}
// linear search code goes here
for (int i = 0; i < n; i++)
{
Expand All @@ -16,9 +24,12 @@ int linearSearch(int search,int n,int arr[])
return -1;
}
int main()
{
{ int key;
printf("Enter your key:");
scanf("%d",&key);
int arr[] = {5, 3, 7, 9, 10, 12, 7, 2, 4};
// main program
printf("%d",linearSearch(7,sizeof(arr),arr));

linearSearch(arr[],key,9);
return 0;
}