Write the selection sort algorithm for an array of int in C++. You are to assume that there are predefined functions swapValues and indexOfSmallest, that is do not write these functions. However, you must write declarations with pre and post conditions for these functions.

Question

What will be an ideal response?

Answer 1

```
void swapValues(int & v1, int& v2);
>>>Attach & to first int for consistency
//precondition: args have been initialized
//postcondition: v1post = v2pre, v2post = v1pre.

int indexOfSmallest(const int a[], int start, int numberUsed);
//Precondition: startIndex is a legal index for array a
// args are initialized.
//Postcondition: index value such that a[i] is the
//smallest of values in the array.

void sort(int a[], int numberUsed)
{
int indexOfNextSmallest;
for(int index=0; index < numberUsed-1; index++)
{// place next smallest in a[index]
indexOfNextSmallest =
indexOfSmallest(a, index, numberUsed);
swapValues(a[index], a[indexOfNextSmallest]);
//Assert:[0]<=a[1]<=...<=a[index] are the smallest
//of the original array elements. The rest of the
//elements are at index values beyond index.
}
}
```