Search element in a sorted matrix

SortedSearch.cpp

#include <bits/stdc++.h>
using namespace std;
const int r=5,c=5;
//assume matrix as a 1D array
// O(log(mn)) 
bool findElement(int arr[r][c],int l,int h,int x)
{
	while(l<=h)
	{
		//get the middle index
		int mid=(l+h)/2;
		//get the corresponding row and column for middle element
		// since index_1D_array=TotalColumns*(current row)+(current column)
		int i=mid/c;
		int j=mid%c;
		cout<< " L: " << l << " H: " << h << " mid: "<< mid<<" "<< " i:"<< i << " j:" << j << "  " << arr[i][j]<< " " << endl;
		if(x==arr[i][j]) 
		{
			cout<<"Found at a["<<i<<"]["<<j<<"]";
			return true;
		}
		if(x<arr[i][j])
		    h=mid-1;
		else 
		    l = mid+1;
	}
	return false;
}

int main() {

 	int arr[r][c]={{1,2,3,4,5},{6,7,8,9,10},{11,12,13,14,15},{16,17,18,19,20},{21,22,23,24,25}};
 	int l=0,h=r*c-1;
 	int x=24;
 	if(!findElement(arr,l,h,x))
 	  cout<<"Not Found";
 	
	return 0;
}