Suppose a vector of ints initially has these 8 elements:
6 7 5 9 1 3 2 4
(a) how many swaps will be performed during a selection sort of the elements?

Using the Selection Sort algorithm there will be 5 swaps in total within the vector of ints.

Explanation:

A Selection Sort algorithm compares the first value in the vector with the rest of the values and swaps it for the lowest value. It then moves on to the next value in the vector and repeats the process until the whole vector is sorted.

Initial Vector : 6 7 5 9 1 3 2 4

1st Swap :   1 7 5 9 6 3 2 4

2nd Swap:  1 2 5 9 6 3 7 4

3rd Swap :  1 2 3 9 6 5 7 4

4rth Swap:  1 2 3 4 6 5 7 9

5th Swap:   1 2 3 4 5 6 7 9

After the 5th Swap the Vector is completely Sorted.

I hope this answered your question. If you have any more questions feel free to ask away at

answerapplication;

make sure each item is its own paragraph.