Sorting_Algos/HeapSort.cpp at master · Merna177/Sorting_Algos · 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
#include <iostream>

using namespace std;

int heap[1005],n,len;
int getLeft(int i){
 return i*2+1;
}
int getRight(int i){
 return i*2+2;
}
void heapify(int i){
   int l=getLeft(i);
   int r=getRight(i);
   int largest=i;
   if(l<n&&heap[l]>heap[i])
    largest=l;
   if(r<n&&heap[r]>heap[largest])
    largest=r;
   if(largest!=i){
      swap(heap[largest],heap[i]);
      heapify(largest);
   }
}
void build(){
   for(int i=n/2-1;i>=0;i--)
     heapify(i);

}
void HeapSort(){
    for(int i=n-1;i>=0;i--){
        swap(heap[0],heap[i]);
        n--;
        heapify(0);
    }
}
int main()
{
 n=7;
 len=n;
 heap[0]=8;
 heap[1]=-2;
 heap[2]=10;
 heap[3]=7;
 heap[4]=-10;
 heap[5]=11;
 heap[6]=2610;
 build();
  HeapSort();
  for(int i=0;i<len;i++){
    cout<<heap[i]<<" ";
  }
  return 0;
}