The average number of comparison for the array with 1,000 elements is “ 500 ”.

Question

Want to see the full answer?

Answer 1

Expert Solution & Answer

Chapter 9.2, Problem 9.2CP

Program Description Answer

The average number of comparison for the array with 1,000 elements is “500”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

If a linear search is performed on an array, and it is known that some items are searched for more frequently than others, how can the contents of the array be reordered to improve the average performance of the search?

def weighted_mse_grad(w, X, y, V):"""Calculate gradient of the weight MSE loss in the given point w Parameters----------w: array_likeCurrent point, in which we want to evaluate gradient (vector with k+1 elements)X: array_likeDesign matrix with N rows and k+1 columnsy: array_likeVector with N observations of the target variableV: array_likeDiagonal matrix N x N, with the weightsReturns----------out: ndarrayvector of gradient, k+1"""# your code here # TEST weighted_mse_grad()w = np.zeros(5)X = np.random.randn(10, 5)y = np.ones(10)V = np.diag(np.ones(10)) L_grad = weighted_mse_grad(w, X, y, V)assert(L_grad.shape == (5,)) w = np.zeros(5)X = np.eye(5)y = np.ones(5)V = np.diag(np.ones(5))L_grad = weighted_mse_grad(w, X, y, V)assert(L_grad.shape == (5,)), 'The shape of the output on the test case is wrong'assert(np.allclose(5 * L_grad,- y * 2)), 'The values of the output on the test case is wrong'

The element being searched for is not in an array of 100 elements. What is the maximum number of comparisons needed in a sequential search to determine that the element is not there if the elements are completely unsorted?