hansteinni101721/DobleSpiel
1
0
Fork 0
generated from freudenreichan/info2Praktikum-DobleSpiel
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fertiges Spiel mit einbindung vom Binär Baum mit nicole und lena

Browse Source
This commit is contained in:
Jakob Hofmann 2025-12-18 09:50:21 +01:00
parent 36333491f9
commit ed4edda352
2 changed files with 23 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
highscores.txt
View File

@ -1,3 +1,7 @@
NAME;21730
jakob;11918
jakob;11860 jakob;11860
Jakob;4974 Jakob;4974
player1;3999 player1;3999
NAME;2997
NAME;2995

42
numbers.c
View File

@ -27,33 +27,29 @@ unsigned int setSeed(unsigned int seed_test)
void create_unique_random_numbers(unsigned int len, unsigned int numbers[]) void create_unique_random_numbers(unsigned int len, unsigned int numbers[])
{ {
for (unsigned int i = 0; i < len; i++) TreeNode *root = NULL;
{ int isDuplicate;
unsigned int same = 0;
do for (unsigned int i = 0; i < len; i++)
{ {
unsigned int value = 0; unsigned int same = 0;
value = (rand() % (len * 2) + 1); do
same = 0;
for (unsigned int j = 0; j < i; j++)
{
if (numbers[j] == value)
{ {
same = 1; unsigned int value = rand() % (len * 2) + 1;
break; root = addToTree(root, &value, sizeof(unsigned int), compare, &isDuplicate);
} if (isDuplicate)
} {
same = 1;
}
else
{
numbers[i] = value;
same = 0;
}
} while (same);
}
if (same == 0) clearTree(root);
{
numbers[i] = value;
}
} while (same == 1);
}
} }
unsigned int *createNumbers(unsigned int len) unsigned int *createNumbers(unsigned int len)