I’D MADE THIS CODE OF STAIRCASE SEARCH , PLEASE JUST CHECK WHETHER IT IS CORRECT OR NOT.
//jmd/jmb/osr/jss.
#include
using namespace std;
int main()
{
int n,key;
cin>>n;
int arr[100][100];
cout<<“ENTER ELEMENTS\n”;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
cin>>arr[i][j];
}
}
cout<<"ENTER THE ELEMENT YOU WANT TO SEARCH\n";
cin>>key;
int i=0,j=n-1,pos_i,pos_j;
// int element=arr[i][j];
while((arr[i][j])!=key && (i>=0 && i<n) && (j>=0 && j<n))
{
if(arr[i][j]<key)
{
i++;
}
else if(arr[i][j]>key)
{
j--;
}
else if(arr[i][j]==key)
{
pos_i=i;
pos_j=j;
break;
}
}
if((i>=0 && i<n) && (j>=0 && j<n))
{
cout<<"ELEMENT FOUND AT POSITION ("<<i<<" , "<<j<<")";
}
else
{
cout<<"ELEMENT NOT FOUND\n";
}
}