Search Insert Position Visualizer & Step-by-Step Algorithm Solution

Find target index or insertion position in sorted array using binary search [left, right].

Category: binary-search | Difficulty: Easy

Tags: Binary Search, Range Halving

Search Insert Position

nums (Sorted)
1
0
3
1
5
2
6
3
100%
state
target5
nums.length4
Initialization
1/10
Explanation

Start searchInsert() with nums = [1, 3, 5, 6] and target = 5.

Source Code
1function searchInsert(nums, target) {
2 let left = 0;
3 let right = nums.length - 1;
4 while (left <= right) {
5 const mid = Math.floor((left + right) / 2);
6 if (nums[mid] < target) {
7 left = mid + 1;
8 } else if (nums[mid] > target) {
9 right = mid - 1;
10 } else {
11 return mid;
12 }
13 }
14 return left;
15}