Scribd
Upload
191 views2 pages

Highscore Table in C

This is the source code of a highscore table in C. The program stores 10 highscores in a table, you can add scores to this table and the program sorts them, it's based on a simple linked list and a bubble sort algorythm.

Uploaded by

M. Balázs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
191 views2 pages

Highscore Table in C

This is the source code of a highscore table in C. The program stores 10 highscores in a table, you can add scores to this table and the program sorts them, it's based on a simple linked list and a bubble sort algorythm.

Uploaded by

M. Balázs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

/*

Hi,
This is the source code of a highscore table
The program stores 10 highscores in a table,
can add scores to this table and the program
them, it's based on a simple linked list and
bubble sort algorythm.

in C.
you
sorts
a

Sorry I needed that pdf :)


*/
typedef struct scr{
char name[20];
int score;
} SCORE;
void bubble_sort(SCORE** arr, int n) {
int max = n-1, swap = 1, x;
SCORE* tmp;
while (swap && max > 0) {
for (swap = 0, x = 0; x < max; ++x)
if (arr[x]->score < arr[x+1]->score) {
tmp = arr[x];
arr[x] = arr[x+1];
arr[x+1] = tmp;
swap = 1;
}
max--;
}
}
void fill_blank_highscore(void) {
FILE*highscore;
highscore = fopen("highscore.dat", "w");
int i;
char name[] = "empty";
int score = 0;
for (i = 1; i <= 11; ++i) {
fwrite(&name, sizeof(char), 30, highscore);
fwrite(&score, sizeof(int), 1, highscore);
}
fclose(highscore);
}
SCORE** get_scores() {
FILE *highscore;
highscore = fopen("highscore.dat", "r");
SCORE *p;
SCORE **scores = (SCORE**)malloc(11*sizeof(SCORE*));
int i;
char name[30];
int scr;
for (i = 0; i < 11; ++i) {
-1-

p = (SCORE*)malloc(sizeof(SCORE));
fread(&name, sizeof(char), 30, highscore);
fread(&scr, sizeof(int), 1, highscore);
strcpy(p->name, name);
p->score = scr;
scores[i] = p;
//printf("%s %d\n", scores[i]->name, scores[i]->score);
}
fclose(highscore);
return scores;
}
void save_highscore(SCORE** scores) {
FILE*highscore;
highscore = fopen("highscore.dat", "w");
int i;
for (i = 0; i < 11; ++i) {
fwrite(&scores[i]->name, sizeof(char), 30, highscore);
fwrite(&scores[i]->score, sizeof(int), 1, highscore);
}
//qsort(scores, 11, sizeof(SCORE*), vergleich);
//bubble_sort(scores, 11);
fclose(highscore);
}
void add_score(char* name, int score) {
SCORE** scores;
scores = get_scores();
strcpy(scores[10]->name, name);
scores[10]->score = score;
bubble_sort(scores, 11);
save_highscore(scores);
}
void highscore() {
SCORE** scores;
scores = get_scores();
int i;
for (i = 0; i < 10; ++i) {
printf("%s %d\n", scores[i]->name, scores[i]->score);
free(scores[i]);
}
}

-2-

You might also like