FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Algorithm/Huffman_coding.cpp at main · vatsalya1102/Algorithm · GitHub
vatsalya1102
/
Algorithm
Public
forked from
heyimShivam/Algorithm
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Algorithm
/
Huffman_coding.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
264 lines (154 loc) · 3.72 KB
Breadcrumbs
Algorithm
/
Huffman_coding.cpp
Copy path
File metadata and controls
264 lines (154 loc) · 3.72 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
#
include
<
iostream
>
#
include
<
cstdlib
>
using
namespace
std
;
#
define
MAX_TREE_HT
100
estruct MinHeapNode {
char
data;
unsigned
freq;
struct
MinHeapNode
*left, *right;
};
struct
MinHeap
{
unsigned
size;
unsigned
capacity;
struct
MinHeapNode
** array;
};
struct
MinHeapNode
*
newNode
(
char
data,
unsigned
freq)
{
struct
MinHeapNode
* temp
= (
struct
MinHeapNode
*)malloc
(
sizeof
(
struct
MinHeapNode
));
temp->
left
= temp->
right
=
NULL
;
temp->
data
= data;
temp->
freq
= freq;
return
temp;
}
struct
MinHeap
*
createMinHeap
(
unsigned
capacity)
{
struct
MinHeap
* minHeap
= (
struct
MinHeap
*)
malloc
(
sizeof
(
struct
MinHeap
));
minHeap->
size
=
0
;
minHeap->
capacity
= capacity;
minHeap->
array
= (
struct
MinHeapNode
**)
malloc
(minHeap->
capacity *
sizeof
(
struct
MinHeapNode
*));
return
minHeap;
}
void
swapMinHeapNode
(
struct
MinHeapNode
** a,
struct
MinHeapNode
** b)
{
struct
MinHeapNode
* t = *a;
*a = *b;
*b = t;
}
void
minHeapify
(
struct
MinHeap
* minHeap,
int
idx)
{
int
smallest = idx;
int
left =
2
* idx +
1
;
int
right =
2
* idx +
2
;
if
(left < minHeap->
size
&& minHeap->
array
[left]->
freq < minHeap->
array
[smallest]->
freq
)
smallest = left;
if
(right < minHeap->
size
&& minHeap->
array
[right]->
freq < minHeap->
array
[smallest]->
freq
)
smallest = right;
if
(smallest != idx) {
swapMinHeapNode
(&minHeap->
array
[smallest],
&minHeap->
array
[idx]);
minHeapify
(minHeap, smallest);
}
}
int
isSizeOne
(
struct
MinHeap
* minHeap)
{
return
(minHeap->
size
==
1
);
}
struct
MinHeapNode
*
extractMin
(
struct
MinHeap
* minHeap)
{
struct
MinHeapNode
* temp = minHeap->
array
[
0
];
minHeap->
array
[
0
]
= minHeap->
array
[minHeap->
size
-
1
];
--minHeap->
size
;
minHeapify
(minHeap,
0
);
return
temp;
}
void
insertMinHeap
(
struct
MinHeap
* minHeap,
struct
MinHeapNode
* minHeapNode)
{
++minHeap->
size
;
int
i = minHeap->
size
-
1
;
while
(i && minHeapNode->
freq
< minHeap->
array
[(i -
1
) /
2
]->
freq
) {
minHeap->
array
[i] = minHeap->
array
[(i -
1
) /
2
];
i = (i -
1
) /
2
;
}
minHeap->
array
[i] = minHeapNode;
}
void
buildMinHeap
(
struct
MinHeap
* minHeap)
{
int
n = minHeap->
size
-
1
;
int
i;
for
(i = (n -
1
) /
2
; i >=
0
; --i)
minHeapify
(minHeap, i);
}
void
printArr
(
int
arr[],
int
n)
{
int
i;
for
(i =
0
; i < n; ++i)
cout<< arr[i];
cout<<
"
\n
"
;
}
int
isLeaf
(
struct
MinHeapNode
* root)
{
return
!(root->
left
) && !(root->
right
);
}
struct
MinHeap
*
createAndBuildMinHeap
(
char
data[],
int
freq[],
int
size)
{
struct
MinHeap
* minHeap =
createMinHeap
(size);
for
(
int
i =
0
; i < size; ++i)
minHeap->
array
[i] =
newNode
(data[i], freq[i]);
minHeap->
size
= size;
buildMinHeap
(minHeap);
return
minHeap;
}
struct
MinHeapNode
*
buildHuffmanTree
(
char
data[],
int
freq[],
int
size)
{
struct
MinHeapNode
*left, *right, *top;
struct
MinHeap
* minHeap =
createAndBuildMinHeap
(data, freq, size);
while
(!
isSizeOne
(minHeap)) {
left =
extractMin
(minHeap);
right =
extractMin
(minHeap);
top =
newNode
(
'
$
'
, left->
freq
+ right->
freq
);
top->
left
= left;
top->
right
= right;
insertMinHeap
(minHeap, top);
}
return
extractMin
(minHeap);
}
void
printCodes
(
struct
MinHeapNode
* root,
int
arr[],
int
top)
{
if
(root->
left
) {
arr[top] =
0
;
printCodes
(root->
left
, arr, top +
1
);
}
if
(root->
right
) {
arr[top] =
1
;
printCodes
(root->
right
, arr, top +
1
);
}
if
(
isLeaf
(root)) {
cout<< root->
data
<<
"
:
"
;
printArr
(arr, top);
}
}
void
HuffmanCodes
(
char
data[],
int
freq[],
int
size)
{
struct
MinHeapNode
* root
=
buildHuffmanTree
(data, freq, size);
int
arr[
MAX_TREE_HT
], top =
0
;
printCodes
(root, arr, top);
}
int
main
()
{
char
arr[] = {
'
a
'
,
'
b
'
,
'
c
'
,
'
d
'
,
'
e
'
,
'
f
'
};
int
freq[] = {
5
,
9
,
12
,
13
,
16
,
45
};
int
size =
sizeof
(arr) /
sizeof
(arr[
0
]);
HuffmanCodes
(arr, freq, size);
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL