Binary Search

easy Points: 100

Problem Statement

Given a sorted array of n 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.

Constraints

  • 1 ≤ n ≤ 105
  • Input is a list of integers

Examples

Input: [2, 7, 11, 15], target = 9
Output: [0, 1]
Solve Now Ask an Expert

Need Help?

Connect with expert programmers on CodeConnect for real-time collaborative coding, video meetings, and whiteboard sessions.