#include <iostream>
#include <time.h>
using namespace std;

int binarySearch(int a[], int elem, int low, int up) {
    if (low > up) return -1;
    int middle = (low + up)/2;
    if (a[middle] == elem) return middle;
    if (a[middle] > elem) return binarySearch(a, elem, low, middle - 1);
    else return binarySearch(a, elem, middle + 1, up);
}

void quickSort(int a[], int left, int right) {
    if (left > right) return;
    int p = a[(left + right) / 2];
    int i = left;
    int j = right;
    while (i <= j) {
        while (a[i] < p) i++;
        while (a[j] > p) j--;
        if (i <= j) {
            int temp = a[i];
            a[i] = a[j];
            a[j] = temp;
            i++;
            j--;
        }
    }
    quickSort(a, left, j);
    quickSort(a, i, right);
}


int main()
{
    setlocale(LC_ALL, "rus");
    srand(time(0));
    const int N = 10;
    int a[N];

    cout << "Исходный массив:\n"; \
        for (int i = 0; i < N; ++i) {
            a[i] = rand() % 16;
            cout << a[i] << "\t";
    }

    cout << endl;
    quickSort(a, 0, N - 1);
    for (int i = 0; i < N; ++i) {
        cout << a[i] << "\t";
    }
    cout << endl;
    system("pause");
    return 0;
}