-
Notifications
You must be signed in to change notification settings - Fork 0
/
heap.c
117 lines (113 loc) · 2.18 KB
/
heap.c
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include<stdio.h>
#define MAX 100
void build_heap(int arr[],int hs);
void insert(int arr[],int data,int *hs);
void delete_root(int arr[],int *hs);
void maxheapify(int arr[],int i,int hs);
int search(int arr[],int data,int hs);
void display(int arr[],int hs);
int isheap(int arr[],int i,int hs);
int main(){
int heap[MAX],hs = 0,n,i,data;
scanf("%d",&n);
hs = n;
for(i=1; i <= n;i++){
scanf("%d",&data);
heap[i] = data;
}
if( isheap(heap,1,n)){
printf("yes\n");
}
else printf("no");
build_heap(heap,hs);
display(heap,hs);
insert(heap,70,&hs);
delete_root(heap,&hs);
display(heap,hs);
return 0;
}
int isheap(int arr[],int i,int hs){
if(i >hs)
return 1;
int j = 2*i;
if(arr[i] < arr[j] && j<=hs)
return 0;
else if(arr[i] < arr[j+1] && j+1<=hs)
return 0;
else
return isheap(arr,2*i+1,hs) && isheap(arr,2*i+2,hs);
}
void build_heap(int arr[],int hs){
int i;
for(i = hs/2; i>0; i--)
maxheapify(arr,i,hs);
}
int search(int arr[],int data,int hs){
int i;
for(i = 1; i <= hs; i++){
if(arr[i] == data)
return 1;
}
return 0;
}
void insert(int arr[],int data,int *hs){
int i;
if(search(arr,data,*hs)){
printf("already there\n");
return;
}
(*hs)++;
arr[*hs] = data;
for(i = *hs/2; i>0; i = i/2)
maxheapify(arr,i,*hs);
}
void delete_root(int arr[],int *hs){
if(hs == 0){
printf("empty heap\n");
return;
}
printf("%d is max\n", arr[1]);
int t,i;
t = arr[1];
arr[1] = arr[*hs];
arr[*hs] = t;
(*hs)--;
maxheapify(arr,1,*hs);
}
void max(int arr[],int hs){
if(hs == 0){
printf("empty heap\n");
return;
}
printf("%d is max\n", arr[1]);
}
void maxheapify(int arr[],int i,int hs){
int l,r,largest,t;
l = 2*i;
r = l+1;
largest = i;
while(l <= hs || r <= hs){
if(arr[i] < arr[l] && l <= hs)
largest = l;
if(arr[largest] < arr[r] && r <= hs)
largest = r;
if(largest != i){
t = arr[i];
arr[i] = arr[largest];
arr[largest] = t;
}
else if(largest == i){
break;
}
i = largest;
l = 2*i;
r = l+1;
}
}
void display(int arr[],int hs){
int i;
for(i =1;i <= hs; i++){
printf("%d ",arr[i]);
}
printf("\n");
}