Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Consider the following problem. The input to the probiem is two ascending sorted arrays A and B of positive integers, A (1) < A (2) < ••• < A(m), m > 1. B(1)< B(2) < • • • < B(n), n> 1. An integer x is given. Design an algorithm of lowest O complexity to determine if there are two elements, one in array A and another in array B such that their product is x. State your algorithm in no more than eight simple English sentences such as sort the elements, add the numbers etc. (These two operations may not be the ones you need in your algorithm.) complexity among the following. Do not write a pseudocode. Circle your (a) O (log (m + n)). (c) O (m n). (b) O (m + n) log (m + n)). (d) O(m²+n²) (e) O (m²+n² log (m + n)). (f) none mentioned before. tioned above", state your If your answer is "none complexity.

Consider the following problem. The input to the probiem is two ascending sorted arrays A and B of positive integers, A (1) < A (2) < ••• < A(m), m > 1. B(1)< B(2) < • • • < B(n), n> 1. An integer x is given. Design an algorithm of lowest O complexity to determine if there are two elements, one in array A and another in array B such that their product is x. State your algorithm in no more than eight simple English sentences such as sort the elements, add the numbers etc. (These two operations may not be the ones you need in your algorithm.) complexity among the following. Do not write a pseudocode. Circle your (a) O (log (m + n)). (c) O (m n). (b) O (m + n) log (m + n)). (d) O(m²+n²) (e) O (m²+n² log (m + n)). (f) none mentioned before. tioned above", state your If your answer is "none complexity.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
I need the answer soon as possible please
Consider the following problem. The input to the problem is two ascending sorted arrays A and B of positive integers, A(1) ≤ A(2) ≤ ⋯ ≤ A(m), m ≥ 1. B(1) ≤ B(2) ≤ ⋯ ≤ B(n), n ≥ 1. An integer x is given. Design an algorithm of lowest O complexity to determine if there are two elements, one in array A and another in array B, such that their product is x. State your algorithm in no more than eight simple English sentences such as sort the elements, add the numbers etc. (These two operations may not be the ones you need in your algorithm.) Do not write a pseudocode. Circle your complexity among the following. (a) O(log (m + n)). (b) O(m + n) log (m + n)). (c) O(m n). (d) O(m²+n²). (e) O(m²+n² log(m + n)). (f) none mentioned before. If your answer is “none mentioned above”, state your complexity.
Transcribed Image Text:Consider the following problem. The input to the problem is two ascending sorted arrays A and B of positive integers, A(1) ≤ A(2) ≤ ⋯ ≤ A(m), m ≥ 1. B(1) ≤ B(2) ≤ ⋯ ≤ B(n), n ≥ 1. An integer x is given. Design an algorithm of lowest O complexity to determine if there are two elements, one in array A and another in array B, such that their product is x. State your algorithm in no more than eight simple English sentences such as sort the elements, add the numbers etc. (These two operations may not be the ones you need in your algorithm.) Do not write a pseudocode. Circle your complexity among the following. (a) O(log (m + n)). (b) O(m + n) log (m + n)). (c) O(m n). (d) O(m²+n²). (e) O(m²+n² log(m + n)). (f) none mentioned before. If your answer is “none mentioned above”, state your complexity.
Expert Solution
Step 1

Question is simple and straight forward

Given :

Sorted array A

Sorted array B

x

We have to find one element from array A and one from array B whose product is equal to x

So lets say one element from A is x1 and one from B is y1

so

x1*y1=x (Product of two no equal to x as per question)

x1=x/y1 (so if we know y1 we then know x1 also)

y1 is all element from array A and then we will check wether x/y1 exist in array B or not 

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS