forked from krimanisha/Hacktoberfest21
-
Notifications
You must be signed in to change notification settings - Fork 0
/
heapsort.cpp
63 lines (52 loc) · 1.13 KB
/
heapsort.cpp
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
#include <iostream>
using namespace std;
void heapify(int arr[], int n, int i)
{
int largest = i; // Initialize largest as root
int l = 2 * i; // left child
int r = 2 * i + 1; // right child
// If left child is larger than root
if (l < n && arr[l] > arr[largest])
{
largest = l;
}
// If right child is larger than largest so far
if (r < n && arr[r] > arr[largest])
{
largest = r;
}
// If largest is not root
if (largest != i)
{
swap(arr[i], arr[largest]);
heapify(arr, n, largest); // Recursively heapify the affected sub-tree
}
}
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 printArray(int arr[], int n)
{
for (int i = 0; i < n; i++)
{
cout << arr[i] << " ";
}
cout << "\n";
}
int main()
{
int arr[] = {10, 5, 3, 2, 4, 7, 6, 1, 8};
int n = sizeof(arr) / sizeof(arr[0]);
heapSort(arr, n);
printArray(arr, n);
return 0;
}