public class TargetPositionFinder {
    public int searchInsert(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;
        
        while (left <= right) {
            int mid = left + (right - left) / 2;
            
            if (nums[mid] == target) {
                return mid;
            } else if (nums[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        
        return left;
    }

    public static void main(String[] args) {
        TargetPositionFinder solution = new TargetPositionFinder();

        int[] nums1 = {1, 3, 5, 6};
        int target1 = 5;
        System.out.println("Example 1 -->  " + solution.searchInsert(nums1, target1)); 
        
        int[] nums2 = {1, 3, 5, 6};
        int target2 = 2;
        System.out.println("Example 2 -->  " + solution.searchInsert(nums2, target2)); 
        
        int[] nums3 = {1, 3, 5, 6};
        int target3 = 7;
        System.out.println("Example 3 -->  " +solution.searchInsert(nums3, target3)); 
    }
}