Question: Note: when a problem has an array of real numbers, you cannot use counting sort or radix sort. You are given two arrays A and
Note: when a problem has an array of real numbers, you cannot use counting sort or radix sort.

You are given two arrays A and B, each with n real numbers that are not sorted. Describe an algorithm that, given a number x, finds an a from A and a b from B such that a b-r. State and briefly justify the running time of your algorithm. For ful 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
