Выборочная сортировка

void selectionSort1(int *arr, unsigned int arrSize)
{
    for (unsigned int pass=0; pass<=arrSize-2; ++pass)
    {
        int indexMin = arr[pass];
 
        for (unsigned int i=pass+1; i<=arrSize-1; ++i)
            if (arr[i] < arr[indexMin])
                indexMin = i;
 
        swap(arr[pass], arr[indexMin]);
    }
}

#include <stdio.h>
#include <iostream>
#include <stdlib>
#include <string>
#include <vector>
#include <algorithm>
 
using namespace std;
void printVector(vector<int> vec)
{
    for (int i = 0; i < vec.size(); i++) {
        cout << vec[i] << " ";
    }
    cout << endl;
}
 
void selectionSort(vector<int> &vec)
{
     vector<int>::iterator min = min_element(vec.begin(), vec.end());
     swap(*(vec.begin()), *min);
     vector<int> vec2(vec.begin()+1, vec.end());
     if (vec2.empty()) {
        return;
     }
     selectionSort(vec2);
     vec2.insert(vec2.begin(), *(vec.begin()));
     vec = vec2;
}
 int _tmain(int argc, _TCHAR* argv[])
{
    setlocale(LC_CTYPE,"Russian");
    int mas[] = {2, -1, 5, 3, 6, 7, 0};
    vector<int> vec(&mas[0], &mas[7]);
    selectionSort(vec);
    printVector(vec);
    system("pause");
    return 0;
}

void selectionSort2(int *arr, unsigned int arrSize)
{
    if (arrSize == 0)  return;
 
    int indexMax = arr[0];
    for (unsigned int i=1; i<=arrSize-1; ++i)
        if (arr[i] > arr[indexMax])
            indexMax = i;
 
    swap(arr[indexMax], arr[arrSize-1]);
 
    selectionSort2(arr, arrSize-1);
}

void selectionSort3(int arr[], unsigned int arrSize)
{
    if (arrSize == 0) return;
 
    selectionSort3(arr, arrSize-1);
 
    int  indexMin = arr[0];
    for (unsigned int i=1; i<=arrSize-1; ++i)
        if (arr[i] < arr[indexMin])
            indexMin = i;
 
    swap(arr[indexMin], arr[arrSize-1]);
}