-
Notifications
You must be signed in to change notification settings - Fork 38
/
heapsort.cpp
62 lines (56 loc) · 865 Bytes
/
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
#include<bits/stdc++.h>
using namespace std;
// void swap(int a,int b)
// {
// int temp;
// temp=a;
// a=b;
// b=temp;
// }
void heapify(int a[], int n, int i)
{
int largest = i;
int l = 2*i+1;
int r = 2*i +2;
if (l < n && a[l] > a[largest])
{
largest = l;
}
if (r < n && a[r] > a[largest])
{
largest = r;
}
if (largest != i)
{
swap(a[i], a[largest]);
heapify(a,n,largest);
}
}
void heapsort(int a[], int n)
{
for (int i = n / 2 - 1; i >= 0; i--)
heapify(a, n, i);
for (int i=n-1; i>=0; i--)
{
swap(a[0], a[i]);
heapify(a, i, 0);
}
}
int main()
{
int n;
cout<<"enter the number of elements you want to sort"<<endl;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
heapsort(a,n);
cout<<"numbers after sorting:"<<endl;
for(int i=0;i<n;i++)
{
cout<<a[i]<<" ";
}
return 0;
}