Show Posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.


Messages - BeefEater

Pages: [1]
1
Quake / Enter.net FFA Reunion
« on: December 11, 2004, 10:52:27 AM »
aw ya no. I finally had some time to stop into the server, got to see diffy again any everything, than the map changed to ztn2dm1 and apparently I didnt have that map anymore, so I had to signoff and DL it and by the time I got back no one was left   :(  Thats just my luck

2
Quake / need some help from someone who knows C (real basic stuff)
« on: December 11, 2004, 09:53:40 AM »
disreguard...took care of it

3
Quake / Enter.net FFA Reunion
« on: December 10, 2004, 12:41:42 PM »
aw...Im not gonna be around tonight  :cry:
Otherwise I would be sooo down.
Have fun with out me :wink:

4
Quake / need some help from someone who knows C (real basic stuff)
« on: December 10, 2004, 12:38:08 PM »
I know at least some of you guys are really into programing. My freind has this program for class. He found the code on the internet and wants to just submit it, but he wants to change it alittle so it doesnt look so plagerized (switch variables and stuff like that) and add comments. The problem is he cant really write C and it has been so long since I have that I dont want to screw it up. If someone more competant than I has a few minutes to fix up this code I would appreciate it. In case your worried about the legality of this all, the code was provided free of an copyright, so the only infringement would be his honor code violation. Thanks in advance, Dave.
**********************************************************

#include
#include
#include
#include
#include
#define MAX 10

struct link
{
int freq;
char ch[MAX];
struct link* right;
struct link* left;
};
typedef struct link node;


void sort(node *[], int);
node* create(char[], int);
void sright(node *[], int);
void Assign_Code(node*, int [], int);
void Delete_Tree(node *);




main()
{
node* ptr;
int i, n, total = 0, u, c[15];
char str[MAX];
node* a[12];
int freq;


printf( "Huffman Algorithm\n");
printf( "Copyright (C) 2003 Pradeep P Chandiramani -PCD-\n" );
printf( "Huffman Algorithm comes with ABSOLUTELY NO WARRANTY;\n");
printf( "This is free software, and you are welcome\n" );
printf( "to redistribute it under GNU GENERAL PUBLIC LICENSE\n" );
printf( "For details read gpl.txt included with installation.\n\n" );

printf( "Press any Key to continue..." );
getch();

printf("\nEnter the number of of variables:");/*input the no. of letters*/
scanf("%d", &n);

for (i = 0; i < n; i++)
{
printf("Enter the variable & probability");/*input the letter & frequency*/
scanf("%s %d", str, &freq);

a = create(str, freq);
}



while (n > 1)
{
sort(a, n);
u = a[0]->freq + a[1]->freq;
strcpy(str,a[0]->ch);
strcat(str,a[1]->ch);
ptr = create(str, u);
ptr->right = a[1];
ptr->left = a[0];
a[0] = ptr;
sright(a, n);
n--;

}
Assign_Code(a[0], c, 0);
getch();




}


node* create(char a[], int x)
{
node* ptr;
ptr = (node *) malloc(sizeof(node));
ptr->freq = x;
strcpy( ptr->ch , a);
ptr->right = ptr->left = NULL;
return(ptr);
}


void sort(node* a[], int n)
{
int i, j;
node* temp;

for (i = 0; i < n - 1; i++)
for (j = i; j < n; j++)
if (a->freq > a[j]->freq)
{
temp = a;
a = a[j];
a[j] = temp;
}
}



void sright(node* a[], int n)
{
int i;
for (i = 1; i < n - 1; i++)
a = a[i + 1];
}


void Assign_Code(node* tree, int c[], int n)
{
int i;
if ((tree->left == NULL) && (tree->right == NULL))
{
printf("%s code:", tree->ch);

for (i = 0; i < n; i++)
{
printf("%d", c);
}
printf("\n");
}
else
{
c[n] = 1;
n++;
Assign_Code(tree->left, c, n);
c[n - 1] = 0;
Assign_Code(tree->right, c, n);
}
}


void Delete_Tree(node * root)
{
if(root!=NULL)
{
Delete_Tree(root->left);
Delete_Tree(root->right);
free(root);
}
}
/* END of NON Graphical Routines*/


/* Start of Graphical Routines*/

5
Quake / Howdy
« on: November 17, 2004, 04:09:55 PM »
I just wanted to say hi to all my old enter.net buddies. I ran into stick on the server, and I noticed Majik posting here. Anyone else around?

Anyway, Howdy  :mrgreen:

Pages: [1]