he following is a modified version of Counting sort. New lines or modified lines of code have the comment '//CHANGED' close to them: array of integer numbers:maximum value stored in A1: minimum value stored in A //CHANGED2function counting-sort(A,k,k1)C=new array(k-k1+1) of zeros //CHANGEDR=new array(length(A)) of zeros34pos=0for e <= i < length(A) do7C[A[i]-k1]=C[A[i]-k1]+1 //CHANGEDend forfor e <= i < (k-k1+1) do //CHANGEDfor pos sr < pos+C[i] doR[r]=i+k1 //CHANGED9.101112end for13pos=r14end for15return R16end functioniVhat is the content of array R for the input array A=[2, 3, – 4, 2, – 1]-after executing this modified version of Counting sort?none of the others[2, 2, 3][-4, –1, 2, 2, 3]Execution error, counting sort does not work with negative numbers[3, 2, 2, – 1, –4]

The question is to choose the correct option from the given four options.

he following is a modified version of Counting sort. New lines or modified lines of code have the comment '//CHANGED' close to th : array of integer numbers :maximum value stored in A 1: minimum value stored in A //CHANGED function counting-sort(A,k,k1) C=new array(k-k1+1) of zeros //CHANGED R=new array(length(A)) of zeros 3 4 pos=e for e <- i < length(A) do C[A[i]-k1]=C[A[i]-k1]+1 //CHANGED 6 7 8 end for for e <- i < (k-k1+1) do //CHANGED for pos sr < pos+C[i] do R[r]=i+k1 //CHANGED 9 10 11 12 end for 13 pos=r end for 14 15 return R 16 end functioni /hat is the content of array R for the input array A= [2, 3, –4, 2, – 1] after executing this modified version of Counting sort? O none of the others [2, 2, 3] [-4, –1, 2, 2, 3] Execution error, counting sort does not work with negative numbers

he following is a modified version of Counting sort. New lines or modified lines of code have the comment '//CHANGED' close to th : array of integer numbers :maximum value stored in A 1: minimum value stored in A //CHANGED function counting-sort(A,k,k1) C=new array(k-k1+1) of zeros //CHANGED R=new array(length(A)) of zeros 3 4 pos=e for e <- i < length(A) do C[A[i]-k1]=C[A[i]-k1]+1 //CHANGED 6 7 8 end for for e <- i < (k-k1+1) do //CHANGED for pos sr < pos+C[i] do R[r]=i+k1 //CHANGED 9 10 11 12 end for 13 pos=r end for 14 15 return R 16 end functioni /hat is the content of array R for the input array A= [2, 3, –4, 2, – 1] after executing this modified version of Counting sort? O none of the others [2, 2, 3] [-4, –1, 2, 2, 3] Execution error, counting sort does not work with negative numbers

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: In this assignment, rewrite the Bubble Sort, Selection Sort and Insertion Sort functions meeting the…

A: #CODE: import java.lang.*;import java.io.*;import java.util.Arrays;class Test{ static int…

Q: Write a function with signature double mean (int n, double *xarr) that takes an array xarr of length…

A: Algorithm:The mean function takes two parameters:int n: the length of the input array xarr.double…

Q: Complete the following code: .data Arr dword 3, 4, 1, 8, 2, 5 len dword 6 .code main proc ; In HLL…

A: In this question we have to write assembly code program that calculates and displays the sum of…

Q: Write a function SwapArrayEnds() that swaps the first and last elements of the function's array…

A: Note: Since the array starts from the index 0, the last value has an index equal to size-1. The…

Q: definition of a function, is_reverse, W

A: Here is the solution: Given that two paraeters are the arrays of integers of the equal size.…

Q: Complete the function nthRowOfPascalTriangle() which takes n, as input parameters and returns an…

A: Coded using C++.

Q: Modify the following code to add a new function called “delete_target” that will delete the target…

A: The objective of the question is to modify the given C code by adding a new function named…

Q: DESIGN YOUR OWN SETTING Task: Devise your own setting for storing and searching the data in an…

A: As per the quidelines, I would be able to provide answer for first three parts of the…

Q: Write a function column_maxes described as follows: • It takes two parameters: o an N by N 2D array…

A: For finding the max element of each column in C given below.

Q: Searching: bool linear_search(const bool binary_search(const int arr[], int n, int value, int&…

A: C++ code: #include<iostream>using namespace std; int linear(int ar[],int size,int item){…

Q: Objectives - Apply Quick sort and Insertion sort algorithms Write a program to sort an array of…

A: #Code-…

Q: Description of the assignment: Your program should read in a set of grades (that are all integers)…

A: #include <stdio.h>#include <math.h> void readGrades(double grades[], int* n);void…

Q: Now, write another function that prints the values of any array in reverse order. (The function…

A: Hello student Greetings from my side. Hope you are doing great. I will try my best to answer your…

Q: In python langauge, write a function that adds a random noise to all elements of a NumPy array…

A: import numpy liberary after that add a modifiedArray=np.random.randn(5) It will create an array…

Q: Please solve using C language The function get_tokens gets a string str, and a char delim, and…

A: Answer :

Q: def binarySearchRecursive (my_array, left, right, x): if right >= left: mid = left + (right left) //…

A: Given, def binarySearchRecursive(my_array, left, right, x): if right>=left:…

Question

he following is a modified version of Counting sort. New lines or modified lines of code have the comment '//CHANGED' close to them
: array of integer numbers
:maximum value stored in A
1: minimum value stored in A //CHANGED
2
function counting-sort(A,k,k1)
C=new array(k-k1+1) of zeros //CHANGED
R=new array(length(A)) of zeros
3
4
pos=0
for e <= i < length(A) do
7
C[A[i]-k1]=C[A[i]-k1]+1 //CHANGED
end for
for e <= i < (k-k1+1) do //CHANGED
for pos sr < pos+C[i] do
R[r]=i+k1 //CHANGED
9.
10
11
12
end for
13
pos=r
14
end for
15
return R
16
end functioni
Vhat is the content of array R for the input array A=
[2, 3, – 4, 2, – 1]
-
after executing this modified version of Counting sort?
none of the others
[2, 2, 3]
[-4, –1, 2, 2, 3]
Execution error, counting sort does not work with negative numbers
[3, 2, 2, – 1, –4]

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Similar questions

Python language
Prompt: In Python language, write a function that applies the logistic sigmoid function to all elements of a NumPy array. Code: import numpy as np import math import matplotlib.pyplot as plt import pandas as pd def sigmoid(inputArray): modifiedArray = np.zeros(len(inputArray)) #YOUR CODE HERE: return(modifiedArray) def test(): inputs = np.arange(-100, 100, 0.5) outputs = sigmoid(inputs) plt.figure(1) plt.plot(inputs) plt.title('Input') plt.xlabel('Index') plt.ylabel('Value') plt.show() plt.figure(2) plt.plot(outputs,'Black') plt.title('Output') plt.xlabel('Index') plt.ylabel('Value') plt.show() test()
This sorting function and the merge one is very similar can someone help please? its in C++
4. Arrays. In order to test the functions in this question, you will need an array. We can create a three- dimensional test array as follows: testArray xijk - máx rij,k i=1 i=1 i=1 (b) Now suppose we want a function testFn2 which returns the d2 x d3 matrix {zj.k} where di Zj,k = Σ i=1
JAVA Programming Write a function that returns true if you can partition an array into one element and the rest, such that this element is equal to the product of all other elements excluding itself. Examples canPartition ([2, 8, 4, 1]) → true // 8 = 2 x 4 x 1 canPartition ([-1, -10, 1, -2, 20]) → false canPartition ([-1, -20, 5, -1, -2, 2]) true