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

bintree verbesserung numbers neu

Browse Source
This commit is contained in:
Ben Skuppin 2025-12-08 13:42:10 +01:00
parent 94e58e45bd
commit 2ae4ca5cbe
2 changed files with 37 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
bintree.c
View File

@ -35,11 +35,11 @@ TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, CompareFc
if (cmp == 0){
/*
if (isDuplicate == NULL){
root->right = addToTree(root->right, data, dataSize, compareFct, NULL);
return root;
}
}*/
*isDuplicate = 1;
return root;
@ -60,7 +60,13 @@ TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, CompareFc
// push the top node and push all its left nodes.
void *nextTreeData(TreeNode *root)
{
if (root != NULL){
}
}
// Releases all memory resources (including data copies).
@ -90,3 +96,12 @@ unsigned int treeSize(const TreeNode *root)
return size;
}
int compareFct(const void *a, const void *b){
if(*a>*b)return -1;
if(*b>*a)return 1;
if(*a==*b)return 0;
}

36
numbers.c
View File

@ -19,30 +19,34 @@ unsigned int *createNumbers(unsigned int len)
srand(time(NULL));
unsigned int* numbers =malloc(sizeof(unsigned int) * len);
unsigned int numberTemp;
bool check = false;
unsigned int* numbTempPtr = &numberTemp;
int generated = 0;
int isDuplicate = 0;
TreeNode* root = NULL;
for(int i = 0; i < len; i++){
while(check == false){
numberTemp = (rand() % 2*len)+1;
while(genreated<len){
for(int j = 0; j < i; j++){
if(numberTemp == numbers[j]){
check = false;
numberTemp = (rand() % 2*len)+1;
root = addToTree( root, numbTempPtr, sizeof(unsigned int), compareFct, isDuplicate );
break;
}
if(!isDuplicate){
if(j + 1 == i){
check = true;
}
}
numbers[i] = numberTemp;
numbers[genreated] = numberTemp;
genreated++;
}
}
int DuplicateId;
int DuplicatePlace;
do{
DuplicateId = rand()%len;
DuplicatePlace = rand() % len;
}while(DuplicateId != DuplicatePlace);
numbers[DuplicatePlace] = numbers[DuplicteId];
return numbers;
}