Insertion Sort and Selection Sort Implementation
First tip: use more aggressive warnings, this way you would be warned by the compiler about passing unused parameters into functions, that is you would automatically made:

template&lt;typename Iter&gt;
Iter minIndex(Iter start, Iter end)


Another thing would be, to write your algorithms in similar way as the standard ones. That is avoid passing the reference to the container, but rather pass iterators into it. So your sort functions should look similarly to:

&lt;typename InputIt&gt;
void someSort (InputIt first, InputIt last)


This will e.g. allow you to sort specific parts of your container with no extra effort.