we got an increasing sorted multidimensional array for example:
int[][] mat = {{1,2,3,4}, {5,6,7,8}, {9,10,11,12}, {13,14,15,16}};
How can
You could use the first number of each array (or the last) to find the element where your number could be present and then use binary search on that element to find if it's actually there.