Greatest (or smallest) element gets moved from interval (i+1)..n
to position i
.
for (int i = 0; i < (array.count()-1); ++i) {
int min = i;
for (int j = i+1; j < array.count(); ++j) {
if (array[j] < array[min]) {
min = j;
}
}
array.swap( min, i );
}
⇒
⇒