Author Question: For the binarySearch method in Section 7.10.2, what is low and high after the first iteration of the ... (Read 60 times)

tatyanajohnson · **on:** May 6, 2020

Question 1

Which of the following statements are correct to invoke the printMax method in Listing 7.5 in the textbook?
◦ printMax(new double[]{1, 2, 3});
◦ printMax(new int[]{1, 2, 3});
◦ printMax(1.0, 2.0, 2.0, 1.0, 4.0);
◦ printMax(1, 2, 2, 1, 4);

Question 2

For the binarySearch method in Section 7.10.2, what is low and high after the first iteration of the while loop when invoking binarySearch(new int[]{1, 4, 6, 8, 10, 15, 20}, 11)?
◦ low is 0 and high is 5
◦ low is 4 and high is 6
◦ low is 0 and high is 3
◦ low is 3 and high is 6
◦ low is 0 and high is 6

shayla · **Reply #1 on:** May 6, 2020

A FREE account is required to view all solutions!

Lorsum iprem. Lorsus sur ipci. Lorsem sur iprem. Lorsum sur ipdi, lorsem sur ipci. Lorsum sur iprium, valum sur ipci et, vala sur ipci. Lorsem sur ipci, lorsa sur iprem. Valus sur ipdi. Lorsus sur iprium nunc, valem sur iprium. Valem sur ipdi. Lorsa sur iprium. Lorsum sur iprium. Valem sur ipdi. Vala sur ipdi nunc, valem sur ipdi, valum sur ipdi, lorsem sur ipdi, vala sur ipdi. Valem sur iprem nunc, lorsa sur iprium. Valum sur ipdi et, lorsus sur ipci. Valem sur iprem. Valem sur ipci. Lorsa sur iprium. Lorsem sur ipci, valus sur iprem. Lorsem sur iprem nunc, valus sur iprium.

Answer Preview

Only 49% of students answer this correctly