Search in a matrix whose elements are sorted in insertion order

/*
https://leetcode.com/problems/search-a-2d-matrix/
Logic:binary search
We are just considering matrix as 1d arrray and whenever we need to find the element at
nth position,we find using find_ele function.
*/
def bs(matrix,row,col,i,j,target):
    if i>j:
        return False
    mid=(i+j)//2
    if matrix[mid//col][mid%col]==target:
        return True
    if matrix[mid//col][mid%col]<target:
        return bs(matrix,row,col,mid+1,j,target)
    else:
        return bs(matrix,row,col,i,mid-1,target)

class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        row=len(matrix)
        col=len(matrix[0])
        return bs(matrix,row,col,0,row*col-1,target)