-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmin_max heap.c
122 lines (106 loc) · 1.71 KB
/
min_max 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
118
119
120
121
122
#include<stdio.h>
#include<stdlib.h>
void swap(int *a,int *b)
{
int temp=*a;
*a=*b;
*b=temp;
}
void maxheap(int *a,int s)
{
int mid=s/2,i,j;
for(i=mid;i>=1;i--)
{
int left;
int right;
if(i==mid && s%2==0)
{left=2*i;
right=0;
}
else
{
right=2*i+1;
left=right-1;
}
if(a[i]<a[left] && right==0)
{
swap(&a[i],&a[left]);
}
else
{
if(a[right]<a[left])
{
if(a[left]>a[i])
{
swap(&a[i],&a[left]);
i=mid;
}
}
else
{
if(a[right]>a[i])
{
swap(&a[i],&a[right]);
i=mid;
}
}
}
}
}
void minheap(int *a,int s)
{
int mid=s/2,i,j;
for(i=mid;i>=1;i--)
{
int left;
int right;
if(i==mid && s%2==0)
{left=2*i;
right=0;
}
else
{
right=2*i+1;
left=right-1;
}
if(a[i]>a[left] && right==0)
{
swap(&a[i],&a[left]);
}
else if(right!=0)
{
if(a[right]>a[left])
{
if(a[left]<a[i])
{
swap(&a[i],&a[left]);
i=mid;
}
}
else
{
if(a[right]<a[i])
{
swap(&a[i],&a[right]);
i=mid;
}
}
}
}
}
void main()
{
int heap[11]={0,40,60,10,20,50,30,100,200,25,5};
int i;
for(i=1;i<=10;i++)
printf("%d ",heap[i]);
printf("\nMax Heap=\n");
maxheap(heap,10);
for(i=1;i<=10;i++)
printf("%d ",heap[i]);
printf("\nMin Heap=\n");
minheap(heap,10);
for(i=1;i<=10;i++)
printf("%d ",heap[i]);
getch();
}