Recursive Binary Search C Program in Data Structures

Data Structures Lab Manual / Recursive Binary Search C Program in Data Structures

Program Name: Write a C Program for Recursive Binary Search in Data Structures

Theory

Recursive Binary Search Sort the elements of the array in Ascending order and try to search the key element based 
on the mid value = (beg+end)/2;

Program Code

#include<stdio.h> 
#include<conio.h>

void binarysearch(int [],int,int); 

void main()
{
int a[20],i,n,searchelement; 

printf("Enter Number of Elements: "); 
scanf("%d",&n);

printf("Enter Array Elements: ");  
for(i=0;i<n;i++)
scanf("%d",&a[i]);

printf("Enter Search Element: "); 
scanf("%d",&searchelement);
binarysearch(a,n,searchelement); 
getch();
}

void binarysearch(int a[],int n,int searchelement)
{
int beg,end,mid,loc=-1; beg=0;
end=n-1; while(beg<=end)
{
mid=(beg+end)/2; 
if(searchelement==a[mid])
{
loc=mid; break;
}

else if(searchelement>a[mid])
beg=mid+1; else end=mid-1;
}
if(loc==-1)
printf("Element not Found"); 
else
printf("Element Found at position = %d",loc+1);
}

Input:
Enter Number of Elements: 5
Enter Array Elements: 2 3 1 5 7
Enter Search Element: 1

Output:
Element Found at position = 3

Home Back