---

#include <iostream>
#include <cstdlib>  
#include <ctime>   
#include <algorithm> 

using namespace std;

// --- 1. БЫСТРАЯ СОРТИРОВКА ---
void quickSort(int arr[], int left, int right) {
    int i = left, j = right;
    int pivot = arr[(left + right) / 2];
    while (i <= j) {
        while (arr[i] < pivot) i++;
        while (arr[j] > pivot) j--;
        if (i <= j) {
            swap(arr[i], arr[j]);
            i++;
            j--;
        }
    }
    if (left < j) quickSort(arr, left, j);
    if (i < right) quickSort(arr, i, right);
}

// --- 2. СОРТИРОВКА СЛИЯНИЯМИ ---
void merge(int arr[], int left, int mid, int right) {
    int n1 = mid - left + 1;
    int n2 = right - mid;
    int* L = new int[n1];
    int* R = new int[n2];

    for (int i = 0; i < n1; i++) L[i] = arr[left + i];
    for (int j = 0; j < n2; j++) R[j] = arr[mid + 1 + j];

    int i = 0, j = 0, k = left;
    while (i < n1 && j < n2) {
        if (L[i] <= R[j]) arr[k++] = L[i++];
        else arr[k++] = R[j++];
    }
    while (i < n1) arr[k++] = L[i++];
    while (j < n2) arr[k++] = R[j++];

    delete[] L;
    delete[] R;
}

void mergeSort(int arr[], int left, int right) {
    if (left < right) {
        int mid = left + (right - left) / 2;
        mergeSort(arr, left, mid);
        mergeSort(arr, mid + 1, right);
        merge(arr, left, mid, right);
    }
}

// --- 3. ПИРАМИДАЛЬНАЯ СОРТИРОВКА ---
void heapify(int arr[], int n, int i) {
    int largest = i;
    int l = 2 * i + 1;
    int r = 2 * i + 2;

    if (l < n && arr[l] > arr[largest]) largest = l;
    if (r < n && arr[r] > arr[largest]) largest = r;

    if (largest != i) {
        swap(arr[i], arr[largest]);
        heapify(arr, n, largest);
    }
}

void heapSort(int arr[], int n) {
    for (int i = n / 2 - 1; i >= 0; i--) heapify(arr, n, i);
    for (int i = n - 1; i > 0; i--) {
        swap(arr[0], arr[i]);
        heapify(arr, i, 0);
    }
}

// --- ВСПОМОГАТЕЛЬНОЕ ---
void coppy(int from[], int to[], int n) {
    for (int i = 0; i < n; i++) to[i] = from[i];
}

// --- MAIN ---
int main() {
    setlocale(LC_ALL, "Russian");
    srand(time(0));

    int n = 600000;

    int* original = new int[n];
    int* temp = new int[n];

    for (int i = 0; i < n; i++) original[i] = rand() % 10000;

    clock_t start, end;
    double time_spent;

    cout << "Размер массива: " << n << "\n\n";

    coppy(original, temp, n);
    start = clock();
    quickSort(temp, 0, n - 1);
    end = clock();
    time_spent = double(end - start) / CLOCKS_PER_SEC;
    cout << "1. Быстрая: " << time_spent << " сек.\n";

    coppy(original, temp, n);
    start = clock();
    mergeSort(temp, 0, n - 1);
    end = clock();
    time_spent = double(end - start) / CLOCKS_PER_SEC;
    cout << "2. Слияниями: " << time_spent << " сек.\n";

    coppy(original, temp, n);
    start = clock();
    heapSort(temp, n);
    end = clock();
    time_spent = double(end - start) / CLOCKS_PER_SEC;
    cout << "3. Пирамидальная: " << time_spent << " сек.\n";

    delete[] original;
    delete[] temp;

    return 0;
}