int BinarySearch(int A[], int start, int end, int x){
int mid,t,n=end-start+1;
if(n<=0)
return -1;
else
{
mid=n/2;
if(A[mid]==x)
return mid;
else if(x
int BinarySearch(int A[], int start, int end, int x){
int mid,t,n=end-start+1;
if(n<=0)
return -1;
else
{
mid=n/2;
if(A[mid]==x)
return mid;
else if(x