Huffman Encoding & Decoder

/ * Huffman Coder & Decoder * /

Include #ifndef n #define n 27 #ENDIF #define m (2 * n-1) #define max (100 * n) #define min 5 / * define each node's imformation * / typedef struct nodetype {int Weight; int LCH; int RCH; INT PARENT; CHAR DATA;} node; / * Structure code * / typef struct coretype {int bits [n]; / * 0, 1 * / int start; / * 1..n * /} code; / * assistant variable * / typedef struct sign {int wt; int num;} tag; / * typedef node huftree; typedef code hufcode; * / / * create huftree * / void Create (struct nodetype ht0 [], Struct Codetype HCD0 []) {INT H, I, J, L, K; INT WT; INT C1, SGN = 0, R = 1; CHAR CHR; TAG FLAG [M]; TAG MD; CDE CD; for (i = 1; i <= m; i ) {ht0 [i-1] .parent = 0; ht0 [i-1] .lch = HT0 [i-1] .rch = 0;} for (i = 1; i <= N; i ) {getChar (); printf ("/ n / t / t input% D number", i); printf ("/ n / t / t Please enter data information: Character -" ); chr = getchar (); if ((chr> = 'a') && (chr <= 'z')) || ((chr> = 'a') && (chr <= 'z')) HT0 [i-1] .data = chr; else {printf ("/ n / t / t is too accidental! Again! Againagain !!"); i ; continue;} printf ("/ n / t / T Please enter data information: weight - "); scanf ("% d ", & wt); ht0 [i-1] .weight = wt;} printf (" / n / t / t hard work :). God is kind, hey! There is a result. Go your day! Ha - haha! "); For (i = n 1; i <= m; i ) {for (k = 1, j = 0; k <= i-1; k ) IF (HT0 [K-1] .parent == 0) {J ; flag [j-1] .wt = ht0 [k-1] .weight; flag [j-1] .num = k;} for (l = 1; l flag [h-1] .wt) {md = flag [l-1]; flag [L -1] = flag [h-1]; flag [h-1] = md;}} ht0 [flag [1-1] .NUM-1] .parent = i; ht0 [flag [2-1] .num -1] .parent = i;

HT0 [I-1] .lch = flag [1-1] .Num; ht0 [i-1] .RCH = flag [2-1] .num; ht0 [i-1] .weight = ht0 [flag [1 -1] .NUM-1] .Weight HT0 [FLAG [2-1] .NUM-1] .weight;} / ** / for (i = 0; i <= n; i ) cd.bits [i -1] = 0; for (r = 1; r <= n; R ) {cd.start = n; c1 = r; sgn = HT0 [C1-1] .parent; while (sgn) {ix (ht0 [ SGN-1] .LCH == C1) CD.BITS [CD.Start-1] = 0; ELSE IF (HT0 [SGN-1] .rch == C1) CD.BITS [CD.Start-1] = 1 Cd.start -; c1 = SGN; SGN = HT0 [SGN-1] .parent;} HCD0 [R-1] = Cd;}} / ** / void table (Struct Nodetype HT [], Struct CodeType HCD []) {INT I, J; Create (HT, HCD); for (i = 1; i <= n; i ) {Printf ("/ n% C / T", HT [I-1] .data) For (j = HCD [i-1] .start 1; j <= n; j ) {printf ("% D", HCD [i-1] .bits [j-1]);}}} / ** / void code (Node HT2 [], Code HCD2 []) {char str1 [max]; int H, i, j, k = 0; Create (HT2, HCD2); Printf ("/ n / t Please enter Text: / n "); for (h = 0; (str1 [h] = getchar ())! = '#'; H ); / * great !!!!!!!!!!!! * / while (STR1 [K]! = 0) {for (i = 1; i <= n; i ) IF (HT2 [I-1] .data == STR1 [K]) for (j = HCD2 [i-1] .Start 1; J <= n; j ) Printf ("% d", HCD2 [i-1] .bits [j-1]); k ;} printf ("/ n / t / t wow! too happy ");} / ** / void decoding (Node HT3 [], Code HCD3 [ ]) {char * str2 = ""; Node Q; Create (HT3, HCD3); Printf ("/ t / t Please enter encoding: / n"); scanf ("% s", str2); while (* str2 ) {= HT3 [M-1]; while (q.lch! = 0) {if (* str2 == '0') {q = HT3 [q.LCH-1]; str2 ;} else if (* STR2 == '1') {q = HT3 [q.rch-1]; str2 ;}} printf ("% c", q.data);} printf ("/ n / t / t call! Know that 01 is really romantic :) ")");} / ** / void main () {char ctrl, ctrl1, ctrl2; int i = 0;