You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
92 lines
1.5 KiB
C++
92 lines
1.5 KiB
C++
/*
|
|
* C++ Program to Implement Heap Sort
|
|
*/
|
|
#include <iostream>
|
|
#include <conio.h>
|
|
using namespace std;
|
|
void max_heapify(int *a, int i, int n)
|
|
{
|
|
int j, temp;
|
|
temp = a[i];
|
|
j = 2*i;
|
|
while (j <= n)
|
|
{
|
|
if (j < n && a[j+1] > a[j])
|
|
j = j+1;
|
|
if (temp > a[j])
|
|
break;
|
|
else if (temp <= a[j])
|
|
{
|
|
a[j/2] = a[j];
|
|
j = 2*j;
|
|
}
|
|
}
|
|
a[j/2] = temp;
|
|
return;
|
|
}
|
|
void heapsort(int *a, int n)
|
|
{
|
|
int i, temp;
|
|
for (i = n; i >= 2; i--)
|
|
{
|
|
temp = a[i];
|
|
a[i] = a[1];
|
|
a[1] = temp;
|
|
max_heapify(a, 1, i - 1);
|
|
}
|
|
}
|
|
void build_maxheap(int *a, int n)
|
|
{
|
|
int i;
|
|
for(i = n/2; i >= 1; i--)
|
|
{
|
|
max_heapify(a, i, n);
|
|
}
|
|
}
|
|
int main()
|
|
{
|
|
int n, i, x;
|
|
cout<<"enter no of elements of array\n";
|
|
cin>>n;
|
|
int a[20];
|
|
for (i = 1; i <= n; i++)
|
|
{
|
|
cout<<"enter element"<<(i)<<endl;
|
|
cin>>a[i];
|
|
}
|
|
build_maxheap(a,n);
|
|
heapsort(a, n);
|
|
cout<<"sorted output\n";
|
|
for (i = 1; i <= n; i++)
|
|
{
|
|
cout<<a[i]<<endl;
|
|
}
|
|
getch();
|
|
}
|
|
|
|
/*
|
|
Output
|
|
enter no of elements of array
|
|
7
|
|
enter element1
|
|
34
|
|
enter element2
|
|
45
|
|
enter element3
|
|
12
|
|
enter element4
|
|
40
|
|
enter element5
|
|
6
|
|
enter element6
|
|
75
|
|
enter element7
|
|
36
|
|
sorted output
|
|
6
|
|
12
|
|
34
|
|
36
|
|
40
|
|
45
|
|
75
|