一道来自jhu algorithm的作业题：
Given two sorted arrays A, B, give a linear time algorithm that finds two entries i,j such that|A[i]−B[j]|is minimized. Prove the correctness of your algorithm and analyze the running time.Given two sorted array
阅读背景：
algorithm@ lower_bound implementation(Binary Search)
来源：互联网
分享到：
