Question

Consider the following attempt at a selection sort algorithm implementation in Java:

1 public static void selectionSort(int[] a) {
2 int n = a.length;
3 for (int i = 0; i < n - 1; i++) {
4 int smallest = i;
5 for (int j = 1; j < n; j++) {
6 if (j < smallest) {
7 smallest = j;
8 }
9 }
10 if (i != smallest) {
11 int temp = a[smallest];
12 a[smallest] = a[i];
13 a[i] = temp;
14 }
15 }
16 }

The line numbers are there for reference and are not part of the code.

This implementation has a potential error at the line labeled 6. What is the error?

a. The expression  j < smallest should be i < smallest.

b. The expression j < smallest should be a[j] < a[smallest].

c. The expression j < smallest should be j < smallest - 1.

d. There is no error at this line.

e. The expression j < smallest should be j <= smallest.

Answer 1

$\small \color{blue}Answer:\;\;$

b. The expression j < smallest should be a[j] < a[smallest].