I want with proper explanation and language should be c++ 1.3 Calculate maximum subarray sumGiven an array of numbers, find the maximum sum of any contiguous subarray ofFor example, given the array [34, -50, 42, 14, -5, 86], the maximumsum would be 137, since we would take elements 42, 14, -5, and 86. Given the arraythearray.[-5, -1, -8, -91, the maximum sum would be 0, since we would choose not totakeanyelements.Do this in O(n) time.Follow-up: What if the elements can wrap around? For example, given [8, -1, 3,4], return 15, as we choose the numbers 3, 4, and 8 where the 8 is obtained fromwrapping around.

C++ program to implement a function to return the maximum contiguous sum of elements of the array.

1.3 Calculate maximum subarray sum Given an array of numbers, find the maximum sum of any contiguous subarray of the array. For example, given the array [34, -50, 42, 14, -5, 861, the maximum sum would be 137, since we would take elements 42, 14, –5, and 86. Given the array [-5, -1, -8, -91, the maximum sum would be 0, since we would choose not to take any elements. Do this in O(n) time. Follow-up: What if the elements can wrap around? For example, given [8, -1, 3, 41, return 15, as we choose the numbers 3, 4, and 8 where the 8 is obtained from wrapping around.

1.3 Calculate maximum subarray sum Given an array of numbers, find the maximum sum of any contiguous subarray of the array. For example, given the array [34, -50, 42, 14, -5, 861, the maximum sum would be 137, since we would take elements 42, 14, –5, and 86. Given the array [-5, -1, -8, -91, the maximum sum would be 0, since we would choose not to take any elements. Do this in O(n) time. Follow-up: What if the elements can wrap around? For example, given [8, -1, 3, 41, return 15, as we choose the numbers 3, 4, and 8 where the 8 is obtained from wrapping around.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

A unimodal array is an array that has a sequence of monotonically increasing integers followed by a sequence of monotonically decreasing integers, assuming all elements in the array are unique. Example: А- (4, 5, 8, 9, 10, 11, 7, 3, 2, 1}: A is a unimodal array because there is an increasing sequence followed by a decreasing sequence and the maximum element is 11. B= {11, 9, 8, 7, 5, 4, 3, 2, 1}: B is not a unimodal array because there is no increasing sequence It is simply a decreasing sequence and the maximum element is 11. C= {1, 2, 3, 4, 5, 7, 8, 9, 11}: C is not a unimodal array because There is an increasing sequence, but there is no decreasing sequence and the maximum element is 11. Design an efficient algorithm with the lowest possible complexity to state whether a given array is unimodal or not, and explain why your algorithm is efficient. Analyze the complexity of your algorithm.
CodeGiven 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.
A unimodal array is an array that has a sequence of monotonically increasing integers followed by a sequence of monotonically decreasing integers, assuming all elements in the array are unique. Example: - A= {4, 5, 8, 9, 10, 11, 7, 3, 2, 1}: A is a unimodal array because there is an increasing sequence followed by a decreasing sequence and the maximum element is 11.- B= {11, 9, 8, 7, 5, 4, 3, 2, 1}: B is not a unimodal array because there is no increasing sequence It is simply a decreasing sequence and the maximum element is 11.- C= {1, 2, 3, 4, 5, 7, 8, 9, 11}: C is not a unimodal array because There is an increasing sequence, but there is no decreasing sequence and the maximum element is 11.a) Design an efficient algorithm with the lowest possible complexity to state whether a given array is unimodal or not, and explain why your algorithm is efficient. b) Analyze the complexity of your algorithm. Data Structure With Python
A minimax or saddle point in a two-dimensional array is an element that is the minimum of its row and the maximum of its column, or vice verse. For example, in the following array11 22 33 33 99 55 66 77 77 44 99 22the element 33 is a minimax because it is the maximum of row 0 and the minimum of column 2. The element 55 is another minimax because it is the minimum of row 1 and the maximum of column 1.Write a program that reads a 4-by-3 matrix, and then prints the location and value of each minimax in the matrix. For example, it would printa[0][2] = 33 is a minimax a[1][1] = 55 is a minimaxfor the matrix shown above.
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:
9.). integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1. A subarray is a contiguous part of an array. Example 1: Input: nums = [1], k = 1 Output: 1 Example 2: Input: nums = [1,2], k = 4 Output: -1 Example 3: Input: nums = [2,-1,2], k = 3 Output: 3.
In a non-empty array of integers, the priority of a number is determined by thefrequency of its occurrence. Elements are added as they come but the most frequentelement is deleted first. If two elements have the same priority, then the elementwhich came first will be deleted first. For example: nums = [1,2,3,1,3,1,3,2,3]. Afterthe first deletion now the array will be num={1,2,1,1,2}. Implement a priority queuefor the aforementioned scenario.
Function PrintArray(integer array(?) dataList) returns nothing integer i for i = 0; i < dataList.size; i = i + 1 dataList[i] = Get next input Put dataList to output Put "_" to output // Your solution goes here. Modify as needed i = 0 Complete the PrintArray function to iterate over each element in dataList. Each iteration should put the element to output. Then, put "_" to output. Ex: If dataList's elements are 2 4 7, then output is: 2_4_7_ Function Main() returns nothing integer array(3) userNums integer i for i = 0; i < userNums.size; i = i + 1 userNums[i] = Get next input PrintArray(userNums)
Code only_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..
A "peak" is an entry in an integer array that is bigger than or equal to the adjacent integers, while a "valley" is an element that is smaller than or equal to the surrounding numbers. In the array, for example, 5, 8, 6, 2, 3, 4, 6 are peaks while 5, 2 are troughs. Sort an array of numbers into an alternating series of peaks and troughs. EXAMPLEInput: {5, 3, 1, 2, 3}Output: {5, 1, 3, 2, 3}
Two arrays are provided to you: one longer and one shorter (with all distinguishable items). Search the longer array for the smallest subarray that includes every member in the shorter array. Any arrangement of the components is possible.EXAMPLEInput: {1, 5, 9}{7, 5, 9, 0, 2, 1, 3, 5. 7, 9. 1, 1, 5, 8, 8, 9, 7}Result: [7, 10] (the underlined portion above)
If an array is given, identify the next bigger element for each element in the array, if one exists. If the element is not accessible, print the element itself. The next bigger element y in the array for an element x is the first element that is greater than x and appears on its right side. The element itself is the next bigger member of the array's rightmost element. Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]. use python to code If an array is given, identify the next bigger element for each element in the array, if one exists. If the element is not accessible, print the element itself. The next bigger element y in the array for an element x is the first element that is greater than x and appears on its right side. The element itself is the next bigger member of the array's rightmost element. Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]. use python to code If an array is given, identify the next bigger element for each…