Ceil in a Sorted Array [Search Insert Position] (Leetcode 35)

Ceil of an element in a sorted array

Problem Link: https://leetcode.com/problems/search-insert-position/

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
          
        def modifiedbsearch(nums,target,i,j):
            
            mid=(i+j)//2
            while(i<=j):
                if(nums[mid]==target):
                    self.ceil=mid
                    return
                elif(nums[mid]>target):
                    self.ceil=mid
                    return modifiedbsearch(nums,target,i,mid-1)
                else:
                    return modifiedbsearch(nums,target,mid+1,j)
            
               
        self.ceil=-1
        n=len(nums)
        modifiedbsearch(nums,target,0,n-1)
        if(self.ceil==-1):
            self.ceil=n
        return self.ceil