Question: 1. We have an optimal algorithm that solves the Finding the minimum problem for a given array. a)True b)False 2.When we apply the linear search
1. We have an optimal algorithm that solves the Finding the minimum problem for a given array.
a)True
b)False
2.When we apply the linear search on an array with 12 elements, can we say that the average-case efficiency is 6 comparisons?
a)yes
b)no
3. What is the minimum number of multiplications that we need to evaluate x51?
4.Given a polynomial with 10 terms, we use Horner's rule to evaluate it. How many multiplications do we need?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
