35. Search Insert Position

#code

class Solution {
public:
    int searchInsert(vector<int>& a, int target) {
  
        
        int l = 0;
        int h = a.size()-1;
        
        while(l <= h){
            
            int mid = l + (h-l)/2;
            
            if(a[mid] < target) 
                l = mid+1;
            else 
                h = mid-1;
        }
        return l;    
    }
};