Algorithm Puzzles: Search Insert Position
everyday every week sometimes: Search Insert Position
Puzzle from leetcode:
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.
This puzzle can be resolved by binary search easily: