Question1 (b)Consider the followingalgorithmwhere Small is an array of ninteger values:   AlgorithmQ1 //Input: An array Smallcontaining ninteger values b = ∞ for h = 1 to n-1       for k = h + 1 to n           if (Small[h] –Small[k]) < b                       b = Small[h] –Small[k]                           return b   i.Explain what does this algorithm compute. ii.Findthe asymptotic bound/complexity ofthis algorithm. iii.Producean improved algorithm to Question1 (b) above with a better asymptotic complexity/running time. iv.Findthe asymptotic bound/complexity of the improvedalgorithmin Question 1(b)iii. above.

Q: Please Help me with This Problem Language = C++ Take an array of name A of size 4 X 4. Take input…

A: Program Approach : Include necessary libraries. Define function read matrix for reading matrix from…

Q: Consider the first ten letters of your name and for each letter encode with an integer number. For…

A: Introduction: Here we are required to demonstrate the above algorithm which takes input as 10…

Q: Consider the following sorting problem: you must reorder the elements of an array of numbers…

A: Note :- You have not mention the language of program ,So i am doing your question in C++ .   //C++…

Q: 1. Consider the algorithm for the sorting problem that sorts an array by counting, for each of its…

A: According to the information given:- We have to create algorithm to sort the given list.

Q: 1] represent an array with length n and indices 0 to n – 1. if i > j in A[i..)]

A: First, let's calculate the complexity of boo(). i starts from 1, and after each iteration is…

Q: A unimodal array is an array that has a sequence of monotonically increasing integers followed by a…

A: Let see the solution below.

Q: Given an array of integers, return a new array such that each element at index i of the new array is…

A: Given:

Q: Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n [10]…

A: The given elements are the square of a number that is: 12 = 1, 22 = 4, 32 = 9, 42 = 16... and so on…

Q: Given an unsorted array Arr of size N of positive integers. One number 'A' from set {1, 2, ...N} is…

A: Since the programming language is not mentioned so I have used the C++ programming language. Given:…

Q: You are given an array A[1..n] of positive numbers where Ai] is the stock price on day i. You are…

A: def minimumLoss(price): price_map = [] # price_map wil store records of (PRICE, DAY) for i…

Q: Consider the Bubble Sort algorithm we developed in class. It works, but it may waste some activity.…

A: Bubble sort is a kind of sorting algorithm where the sorting is done on the basis of comparing…

Q: Write a program to implement the array reversal algorithm with the below-given approach, Do not use…

A: Code is in next step:

Q: Let's say that B is an array with a size of n > 6 that has integers from 1 to n-5, inclusive, in it.…

A: Introduction: Complexity of algorithms: There are various methods for calculating algorithm…

Q: Given an unsorted array of size n. Array elements are in the range from 1 to n. One number from set…

A: Input the values into array Count the numbers from 1 to n If occurred for 0 times, display it as…

Q: Question 1: The following algorithm takes an unsorted array of integer numbers as input and sorts it…

A: Ans:) NOTE: As per the answering guidelines, we can answer only the first question. Please send the…

Q: Plot the result of (given) selectionsort(A) when A is a perfectly sorted and contains randoms…

A: 1. create empty list for storing input size 2. create empty list for storing output size 3. declare…

Q: Q4: 3- For the next (x)array, we find the minimum value of diagonal by: 10 2 3 4 5 4 4 X= 7 4 7 2 5…

A: diag(A) method: It returns a column vector of the main diagonal elements of A. For example, A = [10…

Q: Let A be an array, where each of the n elements is a randomly chosen integer between 1 and n. For…

A: Given array, A= [3,5,1,10,5,7,9,12,2,8,8,6] Number of elements in A is 12. Bubble sort: It compares…

Q: Project-2 Implement MaxHeap sort algorithms on your computer. Run timings for each algorithm on…

A: Program Approach:- Import necessary file. Define the class. Define the variable with a value of 0.…

Q: Let A be an array with n = 2k − 1 elements, where k is some positive integer. Determine a formula…

A:

Q: Consider the following algorithm, which may be called on an array that is not necessarily sorted.…

A: T(n) = 3T(⅔n) + 1; T(0)=0, T(1)=0, T(2) = 1

Q: Suppose we have a 2D array M: [ } ) } ( { ] { (   Write an algorithm to traverse this…

A: Given 2D array, consider consist of set of brackets parenthesis and square brackets. Now we first…

Q: Code in javaScript Given an array of integers arr, implement a function that returns a new array…

A: Algorithm -   Take input from user.  Now use the below logic to solve the problem var r =…

Q: subarray a[l..r] with length at least k with the largest median.   A median in an array of length…

A: Here have to determine about the  array a of length n programming problem statement.

Q: Write method findZero, as started below. findZero should return the index of the first element of…

A: Solution:

Q: Please help urgent! Please show the algorithm clearly thanks

A: For 1A) the following algorithms are coded below to seperate even and odds at left and right places.

Q: Given an array of integers, find the first missing positive integer in linear time and constant…

A: According to the question below the Solution:   Output:

Q: Given an array of integers, return a new array such that each element at index i of the new array is…

A: #include &lt;bits/stdc++.h&gt; using namespace std;    /* Function to print product array  for a…

Q: Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n…

A: Given:- Q:  Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n…

Q: Implement MaxHeap sort algorithms on your computer. Run timings for each algorithm on arrays of size…

A: public class deletionHeap {      static void heapify(int arr[], int n, int i)      {          int…

Q: Quicksort is a powerful divide-and-conquer sorting algorithm that can be described in just four…

A: Quick sort algorithm- counting the number C(n) of comparisons performed to be sorting an array of…

Q: Suppose you are given a set of 100m sprint times from the 2020 olympics. The input list has size n…

A: Solution:- We have to determine the 20 closest times to 10.0 seconds. When we have to find the top x…

Q: . Consider an array of 66000 sorted entries. What is the maximum number of comparisons that must be…

A: Here is the explanation of solution.

Q: a. Write pseudocode for a divide-and-conquer algorithm for finding the position of the largest…

A: A.) public static int indexOfLargest(int[] array) {  int currentMaxIndex = 0;  for (int index =…

Q: Given an array of even size N, task is to find minimum value that can be added to an element so that…

A: CODE:

Q: Java: Consider the following algorithm for searching in an unsorted array. If the size of the array…

A: This Algorithm is based on Merge sort.  Pseudocode for Merge sort: We shall now see the pseudocodes…

Q: 2. Consider the Quick-sort algorithm, which partitions elements into two sub-arrays, each of which…

A: Here, we are going to find out the recurrence relation using quick sort for the given partitions.

Q: The algorithm below searches for the maximum in an input array A. Assume A is a random sequence…

A: Consider the Line 1: max=A[1], “A” is a random sequence containing “n” numbers. “A[1]” is…

Q: 1.a)Given an array which is sorted in descending [large to small] order and got no repeated numbers.…

A:

Q: Consider the Insertion Sort Function below: public static void insertionSort(int array[]) { int n =…

A: In Insertion sort the array is virtually split into a sorted and an unsorted part. Values from the…

Q: Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n Suppose a number…

A: So a) Iterate the array and check if a[i] == i^2 or not

Q: ) Consider the Median-of-Medians algorithm for selecting the i-th smallest element in an array, as…

A: The median-of-medians algorithm is a deterministic linear-time selection algorithm. The algorithm…

Q: Let's play a game from which you are not yet familiar so quickly I will introduce you with the rule.…

A: Input-Output Details The first line of input contains a single integer TT, denoting the number of…

Q: 2) Algorithm A2: concatenate (s1, s2) 1. Initialize i = strlen(s1) 2. Initialize j = strlen(s2) 3.…

A: Below is the implementation of the above algorithm in the C program: -

Q: Let M(n) be the minimum number of comparisons needed to sort an array A with exactly n ele- ments.…

A: Given :  M(n) = 2M(n/2) + n/2 Case 1: M(2)=1 As n=2, M(2)= 2M(2/2)+2/2                     =2M(1)+1…

Q: Let M[1 .. n] be an array, where each entry contains either a positive or a negative integer. Assume…

A: In given problem, we have anarray M[1 .. n] , in this array, each entry contains either a positive…

Q: ample, given A = {4, 3, 1, 6, 3, 7, 1}, one can move From A[O] to A[1] From A[1] to A[2], A[0] or…

A: there will be a edge between (i, i+1) and we can also travel from i to j if A[i] = A[j] and i!=j ,…

Q: Explain the flow of the code. See attached photo for the problem. (This is not graded) bool…

A: Answer: Flow Statement Types: Selection statements Iteration statements Jump statements Selection…

Randomized Select Algorithm

A randomized algorithm is defined as one that uses a certain amount of randomization in its logic or operation. It is said to be an algorithm that depends on the random number to perform its operation. It is used for reducing the overall time complexity, space complexity in the standard algorithm. The randomized algorithm uses the concept of random numbers to find the solutions to the different kinds of problems and also to improve the problem solutions.