Search Insert Position – Typescript

April 2, 2023

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.

Example 1:

Input: nums = [1,3,5,6], target = 5
Output: 2
Example 2:

Input: nums = [1,3,5,6], target = 2
Output: 1
Example 3:

Input: nums = [1,3,5,6], target = 7
Output: 4

Here is how I use the Binary Search Algorithm with Typescript

>Solution :

Here you can solve Typescript in O(log n) time complexity like this:

function searchInsert(nums: number[], target: number): number {
    let low: number = 0, high: number = nums.length - 1;

    while(low <= high) {
        let mid = Math.floor((low + high) / 2);
        if(nums[mid] == target) {
            return mid;
        } else if(nums[mid] < target) {
            low = mid + 1;
        } else {
            high = mid - 1;
        }
    }

    return low;
};