You are given an array of positive integers S[1, . . . , n]. You are initially positioned at the array’s first index 1, and each element S[i] represents your maximum length of jump at position i. For example, you can jump from position i to any position among i + 1, . . . , i + S[i]. Return true if you can reach the last index, or false otherwise. Precisely define the subproblem. Provide the recurrence equation. Describe the algorithm in pseudocode to compute the optimal value. Describe the algorithm in pseudocode to print out an optimal solution.

You are given an array of positive integers S[1, . . . , n]. You are initially positioned at the array’s first index 1, and each element S[i] represents your maximum length of jump at position i. For example, you can jump from position i to any position among i + 1, . . . , i + S[i]. Return true if you can reach the last index, or false otherwise. Precisely define the subproblem. Provide the recurrence equation. Describe the algorithm in pseudocode to compute the optimal value. Describe the algorithm in pseudocode to print out an optimal solution.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Consider an array A of N values (N entered by the user). Write a C program that creates a second array B such that the i-th element of B, i.e., B[i] is equal to A[0] *A[1] * A[2] * ... A[i]; In other words:- B[0] = A[0]- B[1] = A[0] * A[1];- B[2] = A[0] * A[1] * A[2];- B[3] = A[0] * A[1] * A[2] * A[3]- ....etc.For this exercise, we would like to implement two solutions and compare their complexity /performance in terms of computation time.Solution 1: Implement blindly the following algorithms: for each element B[i], compute A[0] *A[1] * A[2] * .... *A[i] and save the result in B[i];To test the solution, create an array A of 1000 elements and initialize each of its elements with arandom value (instead of asking the user to . To do that, use the function rand, which, every timecalled, returns a random number Questions:- How long does your program take to produce the solution?- Analyze the solution above and explain why it is taking long time. What are the mainfactors that affect how long…
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 array A = [10, 7, 4, 2, 1], and target = 7, return the index of the target if found, else return -1. 1. Can this problem be solved in O(logN)? 2. If so, write the implementation. Mention time and space complexity 3. If this problem cannot be solved using O(logN), what is the solution that you suggest - write the code and also mention time and space complexity.
Let A and B be two arrays of length n, each containing a random permutation of the numbers from 1 to n. An inversion between the two permutations A and B is a pair of values (x, y) where the index of x is less than the index of y in array A, but the index of x is more than the index of y in array B. Design an algorithm which counts the total number of inversions between A and B that runs in O(n log n) time.
Write a program in java for the below given problem statement: Given 2 sorted arrays (in increasing order), find a path through the intersection that produces themaximum sum and return the maximum sum. That is, we can switch from one array to another array only atcommon elements. If no intersection element is present, we need to take the sum of all elements from thearray with greater sum.Sample Input:61 5 10 15 20 2552 4 5 9 15Sample Output :81Explanation :We start from array 2 and take sum till 5 (sum = 11). Then we'll switch to array at element 10 and take till15. So sum = 36. Now, no elements are left in array after 15, so we'll continue in array 1. Hence the sum is81.
A matrix is an array of numbers of size m by n (i.e., m x n). When we multiply 2 matrices, we multiply the matching numbers, then sum them up. Multiplying a matrix of size m x n with another matrix of size n x q will result in a matrix of size m x q. An example is shown in Figure 1: [ ? ? ? ? ? ? ] x [ ? ? ? ? ] = [ ?? +?? ?? + ?? ?? + ?? ?? + ?? ?? + ?? ?? + ?? ] Matrix 3 x 2 Matrix 2 x 2 Matrix 3 x 2 Figure 1: Multiplication of Matrix 3 x 2 and 2 x 2 Write a C++ program that multiplies 2 matrices and return the sum of the transposed matrix. Your program shall include the following: a) Define two 2 dimensional arrays, M and N that each represents a matrix of size 3 x 2 and a matrix of size 2 x 2. Request the user to enter the values for the 2 arrays using advanced pointer notations (refer to your slides for the list of array pointer notations). b) Create a function named multMatrix() that passes as arguments, the values of array M and N, multiplies them and store the results in a new…
Given two arrays A and B of equal size N, the task is to find if given arrays are equal or not. Two arrays are said to be equal if both of them contain same set of elements, arrangements (or permutation) of elements may be different though.Note : If there are repetitions, then counts of repeated elements must also be same for two array to be equal. Example 1: Input: N = 5 A[] = {1,2,5,4,0} B[] = {2,4,5,0,1} Output: 1.
Given an array of locations in memory of n dimensions we want to find out what ordering it has in memory. For example, given the following input array [[[ 0 4 8 12] [16 20 24 28] [32 36 40 44]] [[48 52 56 60] [64 68 72 76] [80 84 88 92]]] your function has to return the tuple: [2,1,0] As a suggestion: - Loop through the number of dimensions - For each dimension generate a list of slices equivalent to the above indexing notation - Get the first two elements of each axis - Order the axes by the difference between those two elements Complete the code: def get_storage_order(r): import numpy as np return to check the code manually: r = np.array([[[ 0, 4, 8, 12], [32, 36, 40, 44], [64, 68, 72, 76]], [[16, 20, 24, 28], [48, 52, 56, 60], [80, 84, 88, 92]]]) get_storage_order(r)
Given an array of locations in memory of n dimensions we want to find out what ordering it has in memory. For example, given the following input array [[[ 0 4 8 12] [16 20 24 28] [32 36 40 44]] [[48 52 56 60] [64 68 72 76] [80 84 88 92]]] your function has to return the tuple: [2,1,0] As a suggestion: - Loop through the number of dimensions - For each dimension generate a list of slices equivalent to the above indexing notation - Get the first two elements of each axis - Order the axes by the difference between those two elements Complete the code: def get_storage_order(r): import numpy as np return
Given an unsorted array A of size N that contains only positive integers, find a continuous sub-array that adds to a given number S and return the left and right index(1-based indexing) of that subarray. In case of multiple subarrays, return the subarray indexes which come first on moving from left to right. Note:- You have to return an ArrayList consisting of two elements left and right. In case no such subarray exists return an array consisting of element -1. Code please.
Given an unsorted array A of size N that contains only positive integers, find a continuous sub-array that adds to a given number S and return the left and right index(1-based indexing) of that subarray. In case of multiple subarrays, return the subarray indexes which come first on moving from left to right. Note:- You have to return an ArrayList consisting of two elements left and right. In case no such subarray exists return an array consisting of element -1.code.
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.