Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an algorithm with O(log n) runtime complexity.

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an algorithm with O(log n) runtime complexity.

Cpp Program Code:

The searchInsert function takes a sorted vector of integers nums and a target integer target. It then performs a binary search to find the index of the target value in the vector, or the index where the target value should be inserted if it is not found. The function returns this index.

In the main function, we create a vector nums and a target value target, and call the searchInsert function with these arguments. The resulting index is printed to the console.

Python Program code:

The searchInsert function takes a sorted list of integers nums and a target integer target. It performs a binary search to find the index of the target value in the list, or the index where the target value should be inserted if it is not found. The function returns this index.

In the main program, we create a list nums and a target value target, and call the searchInsert function with these arguments. The resulting index is printed to the console.