describes a strategy for

If a[] is an array of integers, the pseudo code

```
int k = 0
int m = 1
While m < a.length
If a[m] < a[k] Then
k = m
End If
m = m+1
End While

```

A) sorting an array in ascending order
B) sorting an array in descending order
C) implementing a part of the logic for bubble sort
D) determining the location of the smallest value in the array

D) determining the location of the smallest value in the array