Algor3_2

#include "stdafx.h"
#include "iostream"

using namespace std;

int mas[100];
int n;

void qsort(int n1, int n2)
{
    int i;
    int j=0;
    if (n2-n1>=1)
    {
        for (i = n1;i <= n2;i++)
        {
            if (mas[i] >=mas[n2]) { j = i; break; }
            if (i == n2) { n2--; i = n1; }
        }
        i++;
        if (n2 != n1)
        {
            for (;i < n2;i++)
            {
                if (mas[i] <= mas[n2]) {swap(mas[j], mas[i]); j++;}
            }
            swap(mas[j], mas[n2]);
        }
        for (int i = 0; i < n; i++)
        {
            cout << mas[i] << " ";
        }
        cout << endl;
        qsort(n1, j - 1);
        qsort(j + 1, n2);
    }
}

int main()
{
    int m = 0;
    int n1, x, p = 0, op = 2;
    cout << "razmer:";
    cin >> n;
    cout << "massiv:";
    for (int i = 0;i < n;i++)
    {
        cin >> mas[i];
    }

    qsort(0,n - 1);

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