Question: Find the Missing Integer. You are given a sorted array of N distinct integers drawn from (you know this ahead of time). Since there are
Find the Missing Integer.
You are given a sorted array of N distinct integers drawn from
(you know this ahead of time).
Since there are only N array entries and there are N+1 distinct values in
, exactly one of them must be missing from the array.
Your job: devise an
time algorithm to find the missing integer.
HINT: Think of a "binary-search-like" approach.
COMMENT: You can present your algorithm as a C function but, you must also include an explanation of why it works -- i.e., the underlying logic of your solution.
0..N
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
