From a8c68f80e401062ab5fbba738bdf2721e1dbfc45 Mon Sep 17 00:00:00 2001 From: Walter Schenk Date: Sun, 14 Dec 2025 21:58:12 +0100 Subject: [PATCH] abc --- numbers.c | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/numbers.c b/numbers.c index a83a5ff..694c6e7 100644 --- a/numbers.c +++ b/numbers.c @@ -31,8 +31,8 @@ unsigned int* createNumbers(unsigned int len) TreeNode *numbers; int isDuplicate = 0; - int number = rand() % (2 * len) + 1; - int* array = malloc(len*sizeof(int)); + unsigned int number = rand() % (2 * len) + 1; + unsigned int* array = malloc(len*sizeof(int)); numbers = addToTree(NULL, &number, sizeof(int), compareFct, &isDuplicate); array[0] = number; @@ -49,6 +49,8 @@ unsigned int* createNumbers(unsigned int len) } } + clearTree(numbers); + int duplicatePosition1 = 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) { qsort(numbers, len, sizeof(int), compareFct); - + for(int i = 0; i < len-1; i++){ if(numbers[i] == numbers[i+1]){ return numbers[i];