Function BinSearch

Arrays/31_Menu_for_Array.c:184–211

Binary Search Normal method Function

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

//Binary Search Recursion method Function
void RevBinSearch(struct array arr,int low,int high,int key)