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

You're given an array of N integers, and a number K.The maximum K-product of the array is the maximum product of any K length subsequence of the array. For example, the maximum 2-product of the array [-5, 3, 4, -6] is 30 because the product of the subsequence [-5, -6] is 30 and it is impossible to achieve larger subsequence product.What is the maximum K-product you can achieve? Using JAVA programming output the max K-product.Input:14 25 -3 -4 6Output:30
You're given an array of N integers, and a number K. The maximum K-product of the array is the maximum product of any K length subsequence of the array. For example, the maximum 2-product of the array [-5, 3, 4, -6] is 30 because the product of the subsequence [-5, -6] is 30 and it is impossible to achieve larger subsequence product. What is the maximum K-product you can achieve? Using JAVA programming output the max K- product. Input: 1 42 5 -3 -4 6 Output: 30
Let A be an array of numbers. In the maximum sub-array problem, your goal is to determine the sub-array A[x . . . y] of consecutive terms for which the sum of the entries is as large as possible. For example, if A = [−2, −3, 4, −1, −2, 1, 5, −3], the maximum sub-array is [4, −1, 2, 1, 5], and the largest possible sum is S = 4 − 1 − 2 + 1 + 5 = 7. Suppose A = [1, 2, −4, 8, 16, −32, 64, 128, −256, 512, 1024, −2048]. Determine S, the largest possible sum of a sub-array of A.
Given an array containing integers with N elements, and the sum of consecutive elements in the array with an integer k find out how many of them can be divided into a given integer k without remaining. The array contains n grain elements (array = [ array[0], array[1], …, array[n-1]]). K is a positive integer The sum of consecutive elements for any (first, next) pair first < next ise array[first] + array[next] Enter the Java code that returns the result for the integer array (array) and integer (k) entered in this scope Define the section to be calculated as a Java object (“Question2”). take the note sequence as an entry. public Question2(int[] input) In the “countSumPairs” method to be calculated, take the value “k” as an input and how many pieces in total return that the sum of the pairs is divided by the value “k” without remaining. public int countSumPairs(int k) example; public class Question2 {public Question2(int[] input) {}// Complete the countSumPairs function…
Suppose we are given an array of numbers A[0], A[2], . . . , A[n - 1]. You may assume that n is a multiple of6. We wish to find a number x that simultaneously satisfies two properties: First, x should be in the middle two-thirds ofthe array (in other words, x = A[i] for some n/6 <= i < 5n/6). Second, after sorting the array, x should still be in the middletwo-thirds.2a) Prove that such an x exists. (Hint: how many values are not in the middle two-thirds of the original array? How manyare not in the middle two-thirds of the sorted array?)2b) Describe a linear time algorithm for finding such an x. (Note, if your solution calls one of the algorithms described inthe lectures, you should just refer to it by name, e.g. “quicksort”, rather than explaining how it works.)
Given an array, find the total number of inversions of it. If (i < j) and (A[i] > A[j]), then pair (i, j) is called an inversion of an array A. We need to count all such pairs in the array. For example, Input: A[] = [1, 9, 6, 4, 5] Output: The inversion count is 5 There are 5 inversions in the array: (9, 6), (9, 4), (9, 5), (6, 4), (6, 5)
Given an integer n and an array a of length n, your task is to apply the following mutation to a: Array a mutates into a new array b of length n. For each i from 0 to n - 1, b[i] = a[i - 1] + a[i] + a[i + 1]. If some element in the sum a[i - 1] + a[i] + a[i + 1] does not exist, it should be set to 0. For example, b[0] should be equal to 0 + a[0] + a[1].
Question A: Mapping. The two-sum problem is a popular algorithm problem. Given an array of integers and an integer target, return indices of the two numbers such that they add up to the target. You may assume that each input would have exactly one solution, and you may not use the same element twice. For example, suppose we have an array arr = [1,10,100]. If the target is 11, you should return [0,1] because arr[0] + arr[1] = 1+ 10 = 11. If the target is 101, you should return [0,2] because arr[0] + arr[2] = 1+ 100 = 101. Complete this problem in O(n). Hint: using a hash table.
Given an array A[0 : n−1] of n integers, compute the maximum sum of non-empty consecutive subsequence present in the array.For example, if the input is A = [3, 2, 5, 1, 6], then the output max sum is 17 (the corresponding maximum sum consecutive subsequence is [3, 2, 5, 1, 6]. If the input is A = [−2, 11, −4, 13, −5, −2], then the output max sum is 20 (the corresponding maximum sum consecutive subsequence is [11, −4, 13].(a) Given input A[0 : n − 1] and n, design a divide-and-conquer algorithm which outputs the maximum sum of non-empty consecutive subsequence in the array. You only need to output the sum value and do not need to output the exact subsequence. [We are expecting a brief justification for the intuitive idea of the algorithm and the pseudocode of the algorithm.](b) Let T(n) be the runtime of your algorithm when the input size is n. Establish the recurrence relation of T(n) for your algorithm, and then solve the recurrence relation to provide the big-O runtime of your…
Given an array A[0 : n−1] of n integers, compute the maximum sum of non-empty consecutive subsequence present in the array. For example, if the input is A = [3, 2, 5, 1, 6], then the output max sum is 17 (the corresponding maximum sum consecutive subsequence is [3, 2, 5, 1, 6]. If the input is A = [−2, 11, −4, 13, −5, −2], then the output max sum is 20 (the corresponding maximum sum consecutive subsequence is [11, −4, 13]. (a) Given input A[0 : n − 1] and n, design a divide-and-conquer algorithm which outputs the maximum sum of non-empty consecutive subsequence in the array. You only need to output the sum value and do not need to output the exact subsequence. [We are expecting a brief justification for the intuitive idea of the algorithm and the pseudocode of the algorithm.] (b) Let T(n) be the runtime of your algorithm when the input size is n. Establish the recurrence relation of T(n) for the algorithm, and then solve the recurrence relation to provide the big-O runtime of the…
You have been given an array A of size N and an integer K. This array consists of N integers ranging from 1 to 10^7. Each element in this array is said to have a Special Weight. The special weight of an element a[i] is a[i]%K. You now need to sort this array in Non-Increasing order of the weight of each element, i.e the element with the highest weight should appear first, then the element with the second highest weight and so on. In case two elements have the same weight, the one with the lower value should appear in the output first. Input Format: The first line consists of two space separated integers N and K. The next line consists of N space separated integers denoting the elements of array A. Output Format: Print N space separated integers denoting the elements of the array in the order in which they are required. Constraints: 1≤N≤10^5 1≤A[i]≤10^7 1≤K≤10^7 Note: You need to print the value of each element and not their weight. SAMPLE INPUT 5 21 2 3 4 5 SAMPLE OUTPUT 1 3 5 2 4…
Given two arrays a and b, where both arrays consisting of n positive integers. It is allowed to swap any element from array a with any element from b. Your task is to find the maximum possible sum you can obtain in the array a if you can do no more than (i.e. at most) k moves (swaps). Input • The first line of the test case contains two integers n and k (1sns30;0sksn) - where n is the number of elements in a and b, while k is the maximum number of moves you can do. • The second line of the test case contains n integers a1,a2,... an • The third line of the test case contains n integers b1,b2,..,bn Output Print the answer – the maximum possible sum you can obtain in the array a if you can do no more than (i.e. at most) k swaps. Examples: Ex 1: Ex 2: Ex 3: Input 55 53 40 55665 12345 2243 12543 10 9 10 10 9 2423 Output: 27 39 11 • In the first test case of the example, you don't need to swap anything. • In the second test case of the example, you can swap a1=1 with b1=10, a3=3 with b3=10…