Sortari

#include <iostream>

using namespace std;
void BubleSort(int[], int);
void InsertSort(int [], int);
void SelectionSort(int [], int);
int main()
{
    int  n, v[100], ok;
    cout << "Cate elemente are vectorul"; cin >> n;
    for (int i = 0; i < n; i++)
        cin >> v[i];
    SelectionSort(v, n);
    return 0;
}
void BubleSort(int v[], int n)
{
    int i=0, ok;
    do
    {
        ok=0;
        for (int j=0; j<n-i-1; j++)
        {
            if (v[j]>=v[j+1])
            {
                 swap (v[j], v[j+1]);
                 ok=1;
            }
        }        i++;

    } while (ok==1 && i<n-1);

    for (int i = 0; i < n; i++)
        cout << v[i] << " ";
}
void InsertSort (int v[], int n)
{
    for (int i=1; i<n; i++)
    {
        int k=v[i];
        int j=i-1;
        while (j>=0 && v[j]>=k)
        {
            v[j+1]=v[j];
            j--;
        }
        v[j+1]=k;
    }
     for (int i = 0; i < n; i++)
            cout << v[i] << " ";

}
void SelectionSort (int v[], int n)
{
     for (int i = 0; i < n-1; i++)
    {
        int min_idx = i;
        for (int j = i+1; j < n; j++)
          if (v[j] <= v[min_idx])
            {
                min_idx = j;
                swap(v[min_idx], v[i]);
            }
    }
    for (int i = 0; i < n; i++)
            cout << v[i] << " ";
}