Target Index

Main.cpp

#include <iostream>
#include<vector>

using namespace std;

int searchInsert(vector<int>& nums, int target)
{
    int pivot, left = 0, right = nums.size() - 1;
    while (left <= right) {
      pivot = left + (right - left) / 2;
      if (nums[pivot] == target) return pivot;
      if (target < nums[pivot]) right = pivot - 1;
      else left = pivot + 1;
    }
    return left;
}

int main()
{
    int n;
    cin>>n;
    vector<int> arr(n,0);
    
    for(int i=0;i<n;i++)
    {
        cin>>arr[i];
    }
    
    int target;
    cin>>target;
    
    cout<<searchInsert(arr,target);

    return 0;
}

Main.java

import java.util.*;

public class Main{
    
    public static int searchInsert(int[] nums, int target) {
    int pivot, left = 0, right = nums.length - 1;
    while (left <= right) {
      pivot = left + (right - left) / 2;
      if (nums[pivot] == target) return pivot;
      if (target < nums[pivot]) right = pivot - 1;
      else left = pivot + 1;
    }
    return left;
  }
    
    public static void main(String args[]) {
        Scanner scn = new Scanner(System.in);
        int n = scn.nextInt();
        int[] arr = new int[n];
        
        for(int i=0;i<n;i++)
        {
            arr[i] = scn.nextInt();
        }
        
        int target = scn.nextInt();
        System.out.println(searchInsert(arr,target));
    }
}