Algorithm prefixAvg1(X): input: An n-element array X output: An n-element array A of numbers such that A[i] is the average of elements X[0], ..., X[i] 1 Declare and initialize array A 2 for i = 0 to n-1 do 3 a = 0 4 for j = 0 to i do a += X[j] 6 A[i] = a / (i+1) 7 return array A 5 Algorithm prefixAvg2(X): input: An n-element array X output: An n-element array A of numbers such that A[i] is the average of elements X[0], X[i] .... 1 Declare and initialize array A 2 a = 0 3 for i = 0 to n-1 do a += X[i] 5 A[i] = a / (i+1) 6 return array A 4 %3D

Q: Given an array of integers, return the largest gap between the sorted elements of the array. For…

A: Algorithm -   Create a new class with the name main.  Now create a method with the name largest gap…

Q: Consider a variant of the rod cutting problem in which, in addition to length n of the rod, you are…

A: Heer is first define the recursive formula for L[i,q] in this variant of the rod cutting problem.…

Q: a. Write a RECURSIVE algorithm (or a method) that to detect if a given array of integers is sorted…

A: According to our guidelines, we are allowed to solve only the first question, as they are both…

Q: You want to design an algorithm, called minMax(A,p,r), that takes an array of integers and indexes…

A: It is mention that our algorithm should be non-recursive and with time complexity of Θ(n). Our…

Q: We want to determine if an unsorted array A of n entries has duplicates. These integers are 1,...,…

A: To determine if an unsorted array A of n entries has duplicates, we can use a simple approach based…

Q: Part A: The Fixed Point Problem is: Given a sorted array of distinct elements A[1...n), determine…

A: In computer science, the Fixed Point Problem aims to find an index within a sorted array where the…

Q: integers, and x is an integer in the array A, and l and r are indices l ≤ r between which the…

A: The given algorithm is a binary search algorithm. In binary search, the target value is compared…

Q: can you solve this please ?      Given an array of unsorted integers, you are requested to…

A: The solution to all the four parts are given below with explanations

Q: 20. Given a 4-element array with distinct elements, say {x1, x2, x3, x4}, it is known that x1 is not…

A: We have a 4-element array with distinct elements, and we know that one element, let's say x1, is not…

Q: Problem 5. Let A be an array of n integers, each of which comes from the domain [1,U]. Note that…

A: The question requires to compute, for each distinct integer, how many integers are, less than equal…

Q: Suppose you are responsible for organizing and determining the results of an election. An election…

A: A divide and conquer algorithm for this problem. The problem of finding a winner in an election with…