4 Problem 4 (20 points) Consider the following problem: Input: an array A with n distinct numbers, and an array B with the same n numbers in a different order Output: the goal is find the number whose position in A is most similar to its position in B. Formally, say that a pair (i,j) is related if Ali]- Bİ; we want to find the related pair that minimizes ll-il. If there multiple pairs that minimize lj - il, you only have to return one of them Write pseudocode for an algorithm that solves this problem in O(n) ex- pected time.

4 Problem 4 (20 points) Consider the following problem: Input: an array A with n distinct numbers, and an array B with the same n numbers in a different order Output: the goal is find the number whose position in A is most similar to its position in B. Formally, say that a pair (i,j) is related if Ali]- Bİ; we want to find the related pair that minimizes ll-il. If there multiple pairs that minimize lj – il, you only have to return one of them Write pseudocode for an algorithm that solves this problem in O(n) ex- pected time.



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *