Problem 3, Maximum Subarray Sum The Maximum Subarray Sum problem is the task of finding the contiguous subarray with largest sum in a given array of integers. Each number in the array could be positive, negative, or zero. For example: Given the array [-2, 1, -3, 4, -1, 2, 1, -5, 4] the solution would be [4,-1,2, 1] with a sum of 6. (a) (b) Give a brute force solution for this problem with complexity of O(n²). Give a divide and conquer solution for this problem with complexity O(n logn).

Problem 3, Maximum Subarray Sum The Maximum Subarray Sum problem is the task of finding the contiguous subarray with largest sum in a given array of integers. Each number in the array could be positive, negative, or zero. For example: Given the array [-2, 1, -3, 4, -1, 2, 1, -5, 4] the solution would be [4,-1,2, 1] with a sum of 6. (a) (b) Give a brute force solution for this problem with complexity of O(n²). Give a divide and conquer solution for this problem with complexity O(n logn).

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

20. Given a 4-element array with distinct elements, say {x1, x2, x3, x4}, it is known that x1 is not the minimum. How to use 2 comparisons to find an element that is neither the maximum nor the minimum? Solution:
The ColumnChoice problem takes as input a two-dimensional array A[1..m, 1..n] of Os and 1s with m rows and n columns along with a non-negative integer k < n. It asks whether there exists a subset SC {1, ..., n} of k columns such that for each row i e {1,..., m} there exists at least one column j e S where A[i, j] = 1. Prove that ColumnChoice is NP- complete.
Study the function matrix_mult that takes two 2D arrays and performs a matrix multiplication and returns a new two-dimensional array. Each array should be represented as a list of lists. For example, A = [[1, 2, 3], [-2, 3, 7]] B = [[1,0,0],[0,1,O],[0,0,1]] matrix_mult(A, B) [[1, 2, 3], [-2, 3, 7]] Identify all lines that are in error - that is, select all answers that are correct. def matrix_mult(A, B): A_n = len(A) A_m = len(A[0]) B_n = len(B) B_m = len(B[0]) assert A_m = B_n R_n = A_n 1. 2. 3. 4. 5. 6. 7. 8. R_m = B_m R = [[0 for j in range (R_m)] fori in range(R_n)] def row(M, r): return v[c] for v in M def col(M, c): return M[r] def dot(v1, v2): return sum([x*y for x, y in zip(v1, v2)]) for i in range(R_n): for j in range (R_m): R[i][j] - dot(row(A,i), col(8,j)) return R 9. 10. 11. 12. 13. 14.
Given an 8-element array: A = {x1, X2, X3, X4, X5, X6, 7, x8}, we would like to find its 3rd smallest element. It is known that x₁ and 8 are the two extreme elements: max and min, but we do not know which one is the max and which one is the min. It is also known that x4 and x5 are the two medians: left-median and right-median. What is the minimum number of comparisons you need to find the 3rd smallest element of the original array? Ans:
Question 5: Professor Bond has developed the following algorithm that he claims is going to be a break through in computer science. 1 23400 HER 2 { 6 7 8 9 10 11 Assuming array is zero indexed, A[0] is the first and A[n-1] is the last element, the algorithm is as follows: mystery Function (A, n) 12 13 } int last Pos=n-1; while (last Pos > 0) { } int maxPos=0; for (int i=0; i A[maxPos]) i; maxPos = swap (A, maxPos, lastPos); last Pos last Pos - 1; - Given all of this, answer the following questions. Explain what the algorithm does in plain English. Why does the while loop in the algorithm's pseudocode iterate over all ele- ments but the last, rather than for all elements? (c) (d) What is the best-case of this algorithm? What is the (...) bound on the running time of the best-case of this algorithm? What is the worst-case of this algorithm? What is the (...) bound on the running time of the worst-case of this algorithm?
python # Initialize a 6x6 matrix with all elements as 0 matrix = [[0 for _ in range(6)] for _ in range(6)] # Fill in the matrix for i in range(6): # Iterate over rows for j in range(6): # Iterate over columns if i > j: matrix[i][j] = 3*j - 4*i else: matrix[i][j] = 0 # Print the matrix for row in matrix: print(row)
Sparse matrix-vector multiplication in Python is similar to numpy.dot operation, however the provided @ operator is used. Let us consider multiplying a 5 by 5 sparse matrix with a 5 by 3 sparse matrix shown below. 01000 00010 10001 10000 01000 100 001 x 000 010 100 The Python code to implement multiplication of these two sparse matrices
For the following array A=[1,-3,2;-3,3,-1;2,-1,0] find the values of the second column after applying the initial operations H12(-1), H23(1), H21, K23(-1), H13, H1(-1)
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.
Question: Given an array of integers, find the maximum sum of contiguous subarray (containing at least one number). Example: Input: [-2,1,-3,4,-1,2,1,-5,4] Output: 6 (Explanation: [4,-1,2,1] has the largest sum = 6)
H3. Let S = [x1, x2, x3, ...xn], where n ≥ 5. How many ways can you choose five of the values in the array S, given that x1 = x2 = x3 and all other xi are distinct? The order of the chosen elements does not matter
Given an array arr[] of N non-negative integers representing the height of blocks. If width of each block is 1, compute how much water can be trapped between the blocks during the rainy season. Example 1: Input: N = 6 arr[] Output: 10 = {3,0,0,2,0,4}