Function RevBinSearch

Arrays/31_Menu_for_Array.c:214–239

Binary Search Recursion method Function

//Binary Search Recursion method Function
void RevBinSearch(struct array arr,int low,int high,int key)
{
	int mid,x=0;
	if(low<=high)
	{
		mid=(low+high)/2;
		if(arr.A[mid]==key)
		{
			printf("The element is found at location %d\n",mid);
			x=1;
		}
		else if(key<arr.A[mid])
		{
			RevBinSearch(arr,low,mid-1,key);
		}
		else if(key>arr.A[mid])
		{
			RevBinSearch(arr,mid+1,high,key);
		}
	}
	else
	{
		printf("The element is not found\n");
	}
	
}

//Get Function
void Get(struct array arr,int index)