Question

Explain how to solve the following problem iteratively:

"Given an nxm 2D array A such that the elements in each row and each column of A are sorted, and an element x, find indices i and j such that A[i,j] is the largest element less than x, or determine that no such values exist."

Answer 1

#include<Stdio.h>
#include<conio.h>
int i,j;
main(){
int x,y,z;
int a[3][3]={1,2,3,4,5,6,7,8,9};
y=a[0][0];
z=a[0][0];
printf("Enter the number to check");
scanf("%d",&x);
for(i=0;i<3;i++){
for( j=0;j<3;j++){
        if(x<y){
           break;
        }
        else{
           y=a[i][j];
           z=a[i][j];
        }
    }
    }
if(x<y){
    printf("Does not exist");
}
else {
printf("\nThe number is %d index is %d and %d",y,i,j);
    }
}