Question: 2 Sum to . You are given two arrays A and B, each with n real numbers that are not sorted. Describe an algorithm that,
2 Sum to . You are given two arrays A and B, each with n real numbers that are not sorted. Describe an algorithm that, given a number , finds an a from A and a b from B such that ab-r State and briefly justify the running time of your algorithm. Foru credit, your algorithm should run in O(n log n) time
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
