Question: Write an O ( n log n ) algorithm that receives two arrays a and b each with n real numbers and a value val
Write an O (n log n) algorithm that receives two arrays a and b each with n real numbers and a value val. (Make no special assumptions about the arrays.) Your algorithm would return true if there are distinct indices i and j such that a[i] + b[j] = val and return false otherwise.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
