grafma98967/info2_pr3_doble
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update

Browse Source
This commit is contained in:
maxgrf 2025-12-11 13:58:00 +01:00
parent 6d6febe77e
commit 6ba60e0784
4 changed files with 12 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
doble.exe
View File

Binary file not shown.

1
highscores.txt
View File

@ -2,4 +2,5 @@ player_name;6979
player_name;4982
player1;3999
player_name;3992
player_name;3989
player_name;2996

19
numbers.c
View File

@ -46,12 +46,12 @@ unsigned int *createNumbers(unsigned int len)
}
}
}
// numbers[rand()% (len+1)] = rand()% ((2* len) + 1);
size_t dupIndex = rand() % len; // Index, der dupliziert wird
size_t targetIndex = rand() % len; // Ziel-Index, wo das Duplikat hin soll
//duplizierte Zahl hinzufügen
unsigned int dupIndex = rand() % len;
unsigned int targetIndex = rand() % len;
if (dupIndex != targetIndex)
{
numbers[targetIndex] = numbers[dupIndex]; // echtes Duplikat
numbers[targetIndex] = numbers[dupIndex];
}
return numbers;
free(numbers);
@ -79,12 +79,13 @@ unsigned int *createNumbers(unsigned int len)
free(numbers);
return NULL;
}
// fügt zufällige Zahlen in das Array ein
TreeNode *root = NULL;
for (size_t i = 0; i < len; i++)
{
unsigned int isDup = 0;
numbers[i] = (rand() % (2 * len)) + 1;
//prüft, ob die Zahl schon vorhanden ist
root = addToTree(root, &numbers, sizeof(numbers), compare, &isDup);
if (isDup != 1)
{
@ -92,12 +93,12 @@ unsigned int *createNumbers(unsigned int len)
}
}
// numbers[rand()% len] = (rand()% (2* len) + 1);
size_t dupIndex = rand() % len; // Index, der dupliziert wird
size_t targetIndex = rand() % len; // Ziel-Index, wo das Duplikat hin soll
//duplizierte Zahl hinzufügen
unsigned int dupIndex = rand() % len;
unsigned int targetIndex = rand() % len;
if (dupIndex != targetIndex)
{
numbers[targetIndex] = numbers[dupIndex]; // echtes Duplikat
numbers[targetIndex] = numbers[dupIndex];
}
return numbers;
clearTree(root);

3
stack.c
View File

@ -32,8 +32,7 @@ StackNode *pop(StackNode *stack)
StackNode *newTop = stack->next;
// Daten gehen verloren!
// Caller KANN sie nicht freigeben.
free(stack);
return newTop;