Page 324 - AP Computer Science A, 7th edition

a2, a3. ∗/
//first set max equal to larger of a1 and a2 if (a1 > a2)
max = a1; else
max = a2;
//set max equal to larger of max and a3 if (max < a3)
max = a3;
For this algorithm, which of the following initial setups for a1,
a2, and a3 will cause
(1) the least number of computer operations (best case) and (2) the greatest number of computer operations (worst case)?
(1) largest value in a1 or a2 (1) largest value in a2 or a3 (1) smallest value in a1
(1) largest value in a2
(2) largest value in a3 (2) largest value in a1
(2) largest value in a2
(A) (B) (C) (D) (E)
12. Refer to the following code segment.
/∗∗ Compute the mean of integers 1 .. N.
∗ N is an integer >= 1 and has been initialized. ∗/
int k = 1;
double mean, sum = 1.0; while (k < N)
{
/∗ loop body ∗ / }
mean = sum / N;
What is the precondition for the while loop? (A) k ≥ N, sum = 1.0
(B) sum = 1 + 2 + 3 + ... + k (C) k < N, sum = 1.0
(2) smallest value in a3 (1) smallest value in a1 or a2 (2) largest value in a3