1#include <iostream>
2using namespace std;
3
4void merge(int arr[], int l, int m, int r) {
5    int n1 = m - l + 1;
6    int n2 = r - m;
7    int L[n1], R[n2];
8    for (int i = 0; i < n1; i++)
9        L[i] = arr[l + i];
10    for (int j = 0; j < n2; j++)
11        R[j] = arr[m + 1 + j];
12    int i = 0, j = 0, k = l;
13    while (i < n1 && j < n2) {
14        arr[k++] = L[i] <= R[j] ? L[i++] : R[j++];
15    }
16    while (i < n1)
17        arr[k++] = L[i++];
18    while (j < n2)
19        arr[k++] = R[j++];
20}
21
22void mergeSort(int arr[], int l, int r) {
23    if (l < r) {
24        int m = l + (r - l) / 2;
25        mergeSort(arr, l, m);
26        mergeSort(arr, m + 1, r);
27        merge(arr, l, m, r);
28    }
29}
30
31int main() {
32    int arr[] = {12, 11, 13, 5, 6, 7};
33    int arr_size = sizeof(arr) / sizeof(arr[0]);
34    mergeSort(arr, 0, arr_size - 1);
35    for (int i = 0; i < arr_size; i++)
36        cout << arr[i] << " ";
37    return 0;
38}
39

1using System;

class HeapSort {
    public 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) {
            int swap = arr[i];
            arr[i] = arr[largest];
            arr[largest] = swap;
            Heapify(arr, n, largest);
        }
    }

    public void Sort(int[] arr) {
        int n = arr.Length;

        for (int i = n / 2 - 1; i >= 0; i--)
            Heapify(arr, n, i);

        for (int i = n - 1; i >= 0; i--) {
            int temp = arr[0];
            arr[0] = arr[i];
            arr[i] = temp;
            Heapify(arr, i, 0);
        }
    }

    static void Main() {
        int[] arr = {12, 11, 13, 5, 6, 7};
        HeapSort hs = new HeapSort();
        hs.Sort(arr);
        Console.WriteLine(string.Join(" ", arr));
    }
}