Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Problem 3. Given an array A[1: n] of n positive integers (possibly with repetitions), your goal is to find whether there is a sub-array All: r] such that Ali) = n. Example. Given A = [13, 1,2, 3, 4, 7, 2, 3,8, 9] for n = 10, the answer is Yes since elements in A2 : 5] add up to n = 10. On the other hand, if the input array is A = [3, 2,6,8, 20, 2, 4] for n = 7, the answer is No since no sub-array of A adds up ton=7. Hint: Observe that if Ali] = n, then Ali] = E A[i] – n; this may come handy!

Problem 3. Given an array A[1: n] of n positive integers (possibly with repetitions), your goal is to find whether there is a sub-array All: r] such that Ali) = n. Example. Given A = [13, 1,2, 3, 4, 7, 2, 3,8, 9] for n = 10, the answer is Yes since elements in A2 : 5] add up to n = 10. On the other hand, if the input array is A = [3, 2,6,8, 20, 2, 4] for n = 7, the answer is No since no sub-array of A adds up ton=7. Hint: Observe that if Ali] = n, then Ali] = E A[i] – n; this may come handy!

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

algorithms are solely theoretical for a and b. please number the steps of the algorithm, thank you

Problem 3. Given an array A[1 : n] of n positive integers (possibly with repetitions), your goal is to find whether there is a sub-array A[l : r] such that Ali] = n. 10, the answer is Yes since elements in A[2 : 5] add Example. Given A = [13, 1,2, 3, 4, 7,2, 3, 8, 9] for n up to n = 10. On the other hand, if the input array is A = [3, 2,6, 8, 20, 2, 4] for n = 7, the answer is No since no sub-array of A adds up to n = 7. %3D %3D Hìnt: Observe that if Ali] = n, then Ali] = E-1 A[i] – n; this may come handy! (a) Design an algorithm for this problem with worst-case runtime of O(n). (b) Now suppose our goal is to instead find whether there is a sub-array A[l, r] such that Ali] = n². Design a randomized algorithm for this case with worst-case expected runtime of O(n).
Transcribed Image Text:Problem 3. Given an array A[1 : n] of n positive integers (possibly with repetitions), your goal is to find whether there is a sub-array A[l : r] such that Ali] = n. 10, the answer is Yes since elements in A[2 : 5] add Example. Given A = [13, 1,2, 3, 4, 7,2, 3, 8, 9] for n up to n = 10. On the other hand, if the input array is A = [3, 2,6, 8, 20, 2, 4] for n = 7, the answer is No since no sub-array of A adds up to n = 7. %3D %3D Hìnt: Observe that if Ali] = n, then Ali] = E-1 A[i] – n; this may come handy! (a) Design an algorithm for this problem with worst-case runtime of O(n). (b) Now suppose our goal is to instead find whether there is a sub-array A[l, r] such that Ali] = n². Design a randomized algorithm for this case with worst-case expected runtime of O(n).
Expert Solution
steps

Step by step

Solved in 4 steps with 1 images

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