Skip to content

Create linear_search_using_recursion #74

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
ujjwalgupta2023 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create linear_search_using_recursion #74

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
34 changes: 34 additions & 0 deletions Recurssion/linear_search_using_recursion
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
#include <stdio.h>
// Recursive function to search x in arr[]
int elmntSrch(int arr[], int size, int x) {
int rec;

size--;

if (size >= 0) {
if (arr[size] == x)
return size;
else
rec = elmntSrch(arr, size, x);
}
else
return -1;

return rec;
}

int main(void) {
int arr[] = {12, 34, 54, 2, 3};
int size = sizeof(arr) / sizeof(arr[0]);
int x = 3;
int indx;

indx = elmntSrch(arr, size, x);

if (indx != -1)
printf("Element %d is present at index %d", x, indx);
else
printf("Element %d is not present", x);

return 0;
}