Question: Design an algorithm for this problem with worst-case runtime of O(n). Problem 3. Given an array A[1 : n] of n positive integers (possibly with repetitions), your goal is to findwhether there is a sub-array A[l : r] such thatEAli) = n.i=lExample. Given A =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 Nosince no sub-array of A adds up to n = 7.[13, 1, 2, 3, 4, 7, 2, 3, 8,9] for n = 10, the answer is Yes since elements in A[2 : 5] addHint: Observe that if - A[i] = n, then A[i] = E-1 A[i] -- n; this may come handy!

Answer: Algorithm: Positive Integers: start import header files using namespace std declare method…

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 = n. i=l Example. Given A = 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. [13, 1, 2, 3, 4, 7, 2, 3, 8, 9] for n = 10, the answer is Yes since elements in A[2 : 5] add Hint: Observe that if - A[i] = n, then A[i] = E=1 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 A[l : r] such that = n. i=l Example. Given A = 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. [13, 1, 2, 3, 4, 7, 2, 3, 8, 9] for n = 10, the answer is Yes since elements in A[2 : 5] add Hint: Observe that if - A[i] = n, then A[i] = E=1 A[i] – n; this may come handy!

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

The code for Algorithm computeSpan2(P):Input: An n-element array P of numbersOutput: An n-element array S of numbers such that S[i] is the span of the stock on day i.
Lets say an algorithm has 2 base cases. PsuedoCode: if n == 1 return 0 if n == 2 return 1 return A[n..............n-1]solve the recurrence relation for the above simple recursive algorithm?
Algorithm having runtime of worst case O(k). Can it have runtime of o(k^2) on an input?
4. Give an analysis of the running time (Big-Oh will do). sum = 0; for( i = 0; i < n; ++i ) for( j = 0; j < n * n; ++j ) ++sum;
Can someone give me an example of a simple collinear for loop algorithm that can be run in O(n^3) sequential time?
Build a recursion tree for the following recurrence equation and then solve for T(n)
Write a recurrence for this algorithm and solve it to obtain a tight upper bound on the worst case runtime of this algorithm. You can use any method you like for solving this recurrence.
... Array A contains positive numbers that can be smaller than 1, larger than 1, or equal to 1. Find the sub-array A[..], such that the product of numbers in A[i..j] (i.e., A[i] × A[i+1] x x A[j - 1] x A[j]) is maximized. Of course, you should describe the fastest algorithm that you can find. A product of two numbers can be computed in time 0(1). Describe your algorithm in words, provide a pseudocode and briefly explain why your algo- rithm is correct.
write a computer program that produces the desired output from the given input. Input: Elements in a finite set SOutput: Elements in ℘(S)Algorithm: Use recursion.
Write Iterative Algorithms and Loop InvariantsforMax(a, b, c)PreCond: Input has 3 numbers.
Let A be an array of n integers: (a) Write a pseudo code for a divide-and-conquer algorithm that computes the MAX and MIN values in array A . (b) Write the recurrence for this algorithm. (c) Solve the recurrence using the substitution method.
Computer Algorithms Obtain the complexity of the program fragment below for i <-- 1 to n do k <-- n while K > 1 do K <-- k/2 while (k) end-while end-for