Sorting-Algorithms/HeapSort.cpp at master · bishworup11/Sorting-Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include<bits/stdc++.h>
using namespace std;

void Heapify(int ar[], int n, int i)
{
    int largeI = i;
    int leftChild = (i * 2) + 1;
    int rightChild = (i * 2) + 2;

    if (leftChild <= n && ar[leftChild] > ar[largeI])
    {
        largeI = leftChild;
    }

    if (rightChild <= n && ar[rightChild] > ar[largeI])
    {
        largeI = rightChild;
    }


    if (i != largeI)
    {
        swap(ar[largeI], ar[i]);
        Heapify(ar, n, largeI);
    }


}

void HeapSort(int ar[], int n)
{
    for (int i = (n - 1) / 2; i >= 0; i--)
    {
        Heapify(ar, n, i);
    }
    for (int i = n; i >= 0; i--)
    {

        swap(ar[i], ar[0]);
        Heapify(ar, i - 1, 0);
    }


}


void display(int arr[], int n)
{

    for (int i = 0; i < n; i++)
    {

        cout << arr[i] << " ";
    }
}

int main()
{
    int n;

    printf("input the array length\n");

    cin >> n;
    int ar[n];
    for (int i = 0; i < n; i++)
    {

        cin >> ar[i];
    }
    HeapSort(ar, n - 1);

    display(ar, n);


}