Question: (linear time minimum distance finding) Devise a linear-time algorithm to find the minimum distance between two sorted arrays i.e., find the minimum of |x(i)-y(j)| where
(linear time minimum distance finding) Devise a linear-time algorithm to find the minimum distance between two sorted arrays i.e., find the minimum of |x(i)-y(j)| where {x(i)},{y(j)} are already sorted.
Hint: Consider to merge these two sorted arrays first.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
