Algor2_1

#include "stdafx.h"
#include "iostream"
#include <algorithm>

using namespace std;

int main()
{
    int mas[100];
    bool flag;
    int n,k=0;
    cout << "razmer:";
    cin >> n;
    cout << "massiv:";
    for (int i = 0;i < n;i++)
    {
        cin >> mas[i];
    }

    for (;;)
    {
        flag = false;
        for (int i = 0; i < n-1; i++)
        {
            if (mas[i] == mas[i + 1]) continue;
            k = max(mas[i], mas[i + 1]);
            if (k == mas[i])
            {
                flag = true;
                mas[i] = min(mas[i], mas[i + 1]);
                mas[i + 1] = k;
            }
        }
        if (!flag) break;
    }

    cout << "sort:";
    for (int i = 0;i < n;i++)
    {
        cout << mas[i]<<" ";
    }
    cout << endl;
    system("pause");
    return 0;
}