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

abc

Browse Source
This commit is contained in:
Walter Schenk 2025-12-14 21:58:12 +01:00
parent 8449734941
commit a8c68f80e4
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
numbers.c
View File

@ -31,8 +31,8 @@ unsigned int* createNumbers(unsigned int len)
TreeNode *numbers; TreeNode *numbers;
int isDuplicate = 0; int isDuplicate = 0;
int number = rand() % (2 * len) + 1; unsigned int number = rand() % (2 * len) + 1;
int* array = malloc(len*sizeof(int)); unsigned int* array = malloc(len*sizeof(int));
numbers = addToTree(NULL, &number, sizeof(int), compareFct, &isDuplicate); numbers = addToTree(NULL, &number, sizeof(int), compareFct, &isDuplicate);
array[0] = number; array[0] = number;
@ -49,6 +49,8 @@ unsigned int* createNumbers(unsigned int len)
} }
} }
clearTree(numbers);
int duplicatePosition1 = rand() % len; int duplicatePosition1 = rand() % len;
int duplicatePosition2 = rand() % len; int duplicatePosition2 = rand() % len;
@ -65,7 +67,7 @@ unsigned int* createNumbers(unsigned int len)
unsigned int getDuplicate(const unsigned int numbers[], unsigned int len) unsigned int getDuplicate(const unsigned int numbers[], unsigned int len)
{ {
qsort(numbers, len, sizeof(int), compareFct); qsort(numbers, len, sizeof(int), compareFct);
for(int i = 0; i < len-1; i++){ for(int i = 0; i < len-1; i++){
if(numbers[i] == numbers[i+1]){ if(numbers[i] == numbers[i+1]){
return numbers[i]; return numbers[i];