int binrySrch( int key,int list[], int length){
int e = length-1, s = 0;
int pointer = INT_MAX ;
while( s<=e){
int mid = (s+e)/2;
if (key >list[(s+e)/2]){
s = mid+1;
}
else if ( key < list[mid]){
e = mid-1;
}
else if( key == list[mid]){
pointer = mid;
break;
}
for( int i = s; i<=e;i++){
cout<<list[i]<<',';
}
cout<<endl;
}
return pointer;
}
vs
int binrySrch( int key,int list[], int length){
int e = length-1, s = 0;
int pointer = INT_MAX ;
while( s<=e){
int mid = (s+e)/2;
if (key >list[(s+e)/2]){
s = mid; # doubt
}
else if ( key < list[mid]){
e = mid;
}
else if( key == list[mid]){
pointer = mid;
break;
}
for( int i = s; i<=e;i++){
cout<<list[i]<<',';
}
cout<<endl;
}
return pointer;
}
now i wish to check for test cases, where i should check so as to understand where the second code is not working and creating problem where as working fine for the first one