Practice Test 6

You are implementing insertion sort for a small classroom tool that sorts quiz scores. The program reads $n$ integers into an array (unsorted), then sorts ascending using insertion sort. It must use iteration with a for loop for the outer pass and a while loop to shift elements. Input: first line $n$, second line $n$ integers. Output: the sorted array on one line separated by spaces. Constraints: $1 \le n \le 50$; values are in $-1000, 1000$.

Given the task requirements, which of the following correctly implements the required inner loop structure?

for (int i = 1; i < arr.length; i++) {

    int key = arr<u>i</u>;

    int j = i - 1;

    // inner loop here

}

You are writing a grade-processing program for a teacher. The program reads $n$ integer scores (0–100) into an array and then prints each student's letter grade and the class average. Letter grades are assigned using selection: if score >= 90 then 'A', else if >= 80 then 'B', else if >= 70 then 'C', else if >= 60 then 'D', else 'F'. The program must use iteration to (1) read scores, (2) compute the sum, and (3) print results. Input format: first line $n$, second line contains $n$ scores separated by spaces. Output format: one line per student in the form "score: letter", then a final line "avg: X" where X is the average as a double with one decimal. Constraints: $0 \le n \le 30$; each score is 0–100. Edge cases: if $n=0$, print only "avg: 0.0".

Based on the task requirements, which condition will correctly exit the input-reading loop?

int i = 0;

// read n scores into scores[]

while (/* condition */) {

    scores<u>i</u> = in.nextInt();

    i++;

}