#include<stdio.h>
void input(int array[],int n, int i) ///input an array element with recursion
{
if(i==n)
{
return array;
}
else
{
scanf("%d",&array[i]);
return input(array,n,i+1);
}
}
void search_array(int array[],int n,int i,int j,int m, int src[])
{
if(i==n && j==m) ///base case
{
return ;
}
else if(i==n && j != m)
{
printf("Not Found
");
return search_array(array,n,0,j+1,m,src);
}
else
{
if(array[i]==src[j])
{
printf("%d No Search Element Index: %d
",j+1,i);
return search_array(array,n,0,j+1,m,src);
}
else
{
return search_array(array,n,i+1,j,m,src);
}
}
}
int main()
{
int n;
int array[100],m,src[100];
printf("Please Enter Array Size: ");
scanf("%d",&n);
printf("Enter Array Element: ");
input(array,n,0);
printf("Please Enter total Number you want to search: ");
scanf("%d",&m);
printf("Enter Search Element: ");
input(src,m,0);
printf("
");
search_array(array,n,0,0,m,src);
printf("
");
return 0;
}
Output
Please Enter Array Size: 5
Enter Array Element: 1 2 3 4 5
Please Enter total Number you want to search: 3
Enter Search Element: 4 2 1
1 No Search Element Index: 3
2 No Search Element Index: 1
3 No Search Element Index: 0
Add your comment