-
Notifications
You must be signed in to change notification settings - Fork 1
/
minHeapSort.cpp
63 lines (62 loc) · 1.11 KB
/
minHeapSort.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>
#include<cmath>
using namespace std;
int Heapify(int A[], int i, int size){
int l=2*i;
int r=2*i+1;
int small=i;
if(A[l]<A[r]){
if(l<=size && A[l]<A[i])
small = l;
}
else if(A[l]>A[r]){
if(r<=size && A[r]<A[i])
small = r;
}
if(i != small){
int temp = A[i];
A[i]=A[small];
A[small]=temp;
Heapify(A,small,size);
}
return 0;
}
int constructHeap(int A[], int size){
int x = floor((float)(size/2));
for(int i=x;i>=0;i--)
Heapify(A,i,size);
return 0;
}
int* heapSort(int A[], int n){ // n=size;
while(n>1){
int temp = A[1];
A[1]=A[n];
A[n]=temp;
n--;
Heapify(A,1,n);
}
if(A[1]<A[2]){
int temp = A[1];
A[1]=A[2];
A[2]=temp;
}
return A;
}
int main(){
cout<<"Enter Array size\n";
int size;
cin>>size;
int A[size];
cout<<"Enter elements\n";
for(int i=1;i<=size;i++)
cin>>A[i];
constructHeap(A,size);
cout<<"The heap is"<<endl;
for(int i=1;i<=size;i++)
cout<<A[i]<<"|";
heapSort(A,size);
cout<<"\nThe heap After Sorting is"<<endl;
for(int i=1;i<=size;i++)
cout<<A[i]<<"|";
return 0;
}