---

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

using namespace std;

// ============================================================
// 1. БЫСТРАЯ СОРТИРОВКА (Quick Sort)
// ============================================================
int partition(int arr[], int low, int high) {
    int pivot = arr[high];
    int i = low - 1;

    for (int j = low; j < high; j++) {
        if (arr[j] <= pivot) {
            i++;
            swap(arr[i], arr[j]);
        }
    }
    swap(arr[i + 1], arr[high]);
    return i + 1;
}

void quickSort(int arr[], int low, int high) {
    if (low < high) {
        int pi = partition(arr, low, high);
        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}

// ============================================================
// 2. СОРТИРОВКА СЛИЯНИЯМИ (Merge Sort)
// ============================================================
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]; i++; }
        else              { arr[k] = R[j]; j++; }
        k++;
    }

    while (i < n1) { arr[k] = L[i]; i++; k++; }
    while (j < n2) { arr[k] = R[j]; j++; k++; }

    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. ПИРАМИДАЛЬНАЯ СОРТИРОВКА (Heap Sort)
// ============================================================
void heapify(int arr[], int n, int i) {
    int largest = i;
    int left = 2 * i + 1;
    int right = 2 * i + 2;

    if (left < n && arr[left] > arr[largest]) largest = left;
    if (right < n && arr[right] > arr[largest]) largest = right;

    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];
}

// ============================================================
// ВЫВОД МАССИВА
// ============================================================
void vivodd(int arr[], int n) {
    for (int i = 0; i < n; i++) cout << arr[i] << " ";
    cout << endl;
}

// ============================================================
// ГЛАВНАЯ ФУНКЦИЯ
// ============================================================
int main() {
    setlocale(LC_ALL, "Russian");
    srand(time(0));

    int n;
    cout << "Введите размер массива: ";
    cin >> n;

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

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

    cout << "\nИсходный массив:\n   ";
    vivodd(original, n);

    // 1. Быстрая
    coppy(original, temp, n);
    quickSort(temp, 0, n - 1);
    cout << "\n1. Быстрая сортировка:\n   ";
    vivodd(temp, n);

    // 2. Слияниями
    coppy(original, temp, n);
    mergeSort(temp, 0, n - 1);
    cout << "\n2. Сортировка слияниями:\n   ";
    vivodd(temp, n);

    // 3. Пирамидальная
    coppy(original, temp, n);
    heapSort(temp, n);
    cout << "\n3. Пирамидальная сортировка:\n   ";
    vivodd(temp, n);

    delete[] original;
    delete[] temp;

    return 0;
}