#include
     
      using namespace std;int binsearch(int a[],int low,int high,int k){    if(low>high) return 0;    int mid=(low+high)/2;    if(a[mid]==k)           return mid+1;    else if(a[mid]
      
       >a[i];    while(1)    {    int k;    cout<<"k=";    cin>>k;    cout<
       
        <