Question 4 [2 1: Algorithms Trace and Analysis In a given array of integers, a regional maximum is the largest intezer found in a given region in the array. A region is defined by its starting and ending index. Example: if the array is [9,5,3,2.7,8] and the region is (1.4) then the regional maximum is 7. 3) Trace your method when the array passed is {2,5,3,2,7,8,1,6,9}, start index is 1, end index is 8.

Question 4 [2 1: Algorithms Trace and Analysis In a given array of integers, a regional maximum is the largest intezer found in a given region in the array. A region is defined by its starting and ending index. Example: if the array is [9,5,3,2.7,8] and the region is (1.4) then the regional maximum is 7. 3) Trace your method when the array passed is {2,5,3,2,7,8,1,6,9}, start index is 1, end index is 8.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Write class name Student Management having array of students and count of students as attribute. There should be method for the following: Add new Student in Array Remove a Student from Array using Name (of Student) Sort the Students in array using Name (ascending order) Sort the Students in array using Age (ascending order) Sort the Students in array using CGPA (ascending order) Reverse the order of the Students in array Display information of all Students in array (from zero index to last index) Note.This is a java program
Suppose an array A contains 8 elements as follows: 77,33,X,11,88,Y,6, 15 Where: element X = last two digits of your roll number (e.g., if your roll number is 19106018, then X is 18; if your roll number is 19106001, then X is 1) element Y = last two digits of the number obtained by squaring X (c.g., squarc of X = 18 is 324,50 Y is 24; squarc of X =1 is I,s0 Y is 1). Write an algorithm for insertion sort and step by step ap algorithm on the above example array A.
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:
Suppose that you are playing a card game whose goal is to collect exactly k cards with a total value of t. Write a solution that can determine if it is possible for a given collection of cards whose values are given in the array values. For example, if the array contained the values <10,5,7,2>, k = 3, and t = 12, you would return false because no three values add to 12. However, if t = 14, you would return true, since 5 + 7 + 2 = 14. So I considered this to be a form of groupSum recursion, so I try to implement it in recursion form. However, since the passing parameters are not the incrementing level index but 'k' that is the limit number of the numbers we can choose from the array, I cannot use passing index through recursion to search from the start of the array toward the end of the values.length(the length of the array). would there be any method I can use to increment and search along the array using k, the number of numbers we can add into the total(t) instead of the…
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.
Course: Data structure and algorithms: Topic: Algorithm Complexity: Please solve it o emergency basis: Question 2: Imagine that we want to keep track of friendships between n people. We can do this with an array of size nXn. Each row of the array represents the friends of an individual, with the columns indicating who has that individual as a friend. For example, if person j is a friend of person i, then we place a mark in column j of row i in the array. Likewise, we should also place a mark in column i of row j if we assume that friendship works both ways. What will be the space complexity of this problem.
You are given 4 items as (value, weightpairs in this format {{20, 5), (60, 20), (25, 10), (X, 25}}You can assume that the array is sorted based on the ratio. The capacity of knapsack is 50. The item no. 4 (whose weights 25) is taken fractionally to fill upto the knapsack capacity. That fraction is represented in format. What is the lowest possible value of ? weight
• Method section_6 Given two arrays (a and b) with equal length and that have at least one element, for everyelement in array a, consider the corresponding element in array b (at the same index) and addthe element from array b to the element in array a (modifying the elements in array a). Example:a is: 4 2 6 5b is: 2 3 7 4Resulting state of a is: 6 5 13 9(b remains the same)�� Do NOT print the array; the testing section will print the array.
Write method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example: Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {
A magic square is a square array of non-negative integers where the sums of the numbers on each row,each column, and both main diagonals are the same. An N × N occult square is a magic square with Nrows and N columns with additional constraints:• The integers in the square are between 0 and N, inclusive.• For all 1 ≤ i ≤ N, the number i appears at most i times in the square.• There are at least two distinct positive integers in the square.For example, the following is a 5 × 5 occult square, where the sums of the numbers on each row, eachcolumn, and both main diagonals are 7:0 0 0 3 42 4 0 0 10 0 3 4 05 0 0 0 20 3 4 0 0For a given prime number P, you are asked to construct a P × P occult square, or determine whether nosuch occult square exists.InputInput contains a prime number: P (2 ≤ P ≤ 1000) representing the number of rows and columns in theoccult square.OutputIf there is no P × P occult square, simply output -1 in a line. Otherwise, output P lines, each contains Pintegers…
In an array-based implementation of a List, why does the add operation take O(n) time in the average case? Select one: a. The time it takes to shift entries over to make room in the array depends on the number of entries in the List b. The time to copy the current entries into a newly allocated, larger array depends on the number of entries in the List c. The time to access the position in the array to add the new entry depends on the number of entries in the List d. The time to access the position in the array to add the new entry depends on the capacity of the array
In a non-empty array of integers, the priority of a number is determined by the frequency of its occurrence. Elements are added as they come but the most frequent element is deleted first. If two elements have the same priority then the element which came first will be deleted first. For example: nums = [1,2,3,1,3,1,3,2,3]. After the first deletion now the array will be num=[2,3,3,3,2,3]. Implement a priority queue for the aforementioned scenario. please answer asap ty.