1def mergeSort(arr):
2    if len(arr) > 1:
3        mid = len(arr) // 2
4        L = arr[:mid]
5        R = arr[mid:]
6        mergeSort(L)
7        mergeSort(R)
8        i = j = k = 0
9        while i < len(L) and j < len(R):
10            if L[i] < R[j]:
11                arr[k] = L[i]
12                i += 1
13            else:
14                arr[k] = R[j]
15                j += 1
16            k += 1
17        while i < len(L):
18            arr[k] = L[i]
19            i += 1
20            k += 1
21        while j < len(R):
22            arr[k] = R[j]
23            j += 1
24            k += 1
25
26arr = [12, 11, 13, 5, 6, 7]
27mergeSort(arr)
28print(arr)
29

1#include <iostream>
using namespace std;

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

int main() {
    int arr[] = {12, 11, 13, 5, 6, 7};
    int n = sizeof(arr) / sizeof(arr[0]);
    heapSort(arr, n);
    for (int i = 0; i < n; i++)
        cout << arr[i] << " ";
    return 0;
}