Bill has an algorithm, find2D, to find an element x in an n × n array A. The algorithm find2D iterates over the rows of A and calls the algorithm arrayFind, of Algorithm 1.12, on each one, until x is found or it has searched all rows of A. What is the worst-case running time of find2D in terms of n? Is this a linear-time algorithm? Why or why not?

The worst case run time of Find2D is O(n²) because the worst case run time of arrayFind is O(n) and this function will be called for n rows from Find2D algorithm, hence O(n²) .

An algorithm is said to have linear time if its worst case run time is O(n). Since it is O(n²) for Find2D, it is not a linear time algorithm

Step-by-step explanation:

sorry not sure

step-by-step explanation:

hello,

b) 62.47% of the students are between 14 and 18 years old.

step-by-step explanation:

mean = 15 and standard deviation = 2

student between 14 to 18

formula used z-score

for age 14 , z score

using z-table , p(z> -0.5)=0.3085

for age 18 , z score

using z-table , p(z< 1.5)=0.9332

p(-0.5< z< 1.5)=0.9332-0.3085 = 0.6247

thus, 62.47% of the students are between 14 and 18 years old.

click to let others know, how is it

0.0

0 votes

1

report

read more on -

step-by-step explanation: