From f9bca135ec9c0e99765d4ff4fc37cb736e6ff1c7 Mon Sep 17 00:00:00 2001
From: maxgrf <r9ky2wmtjf@privaterelay.appleid.com>
Date: Thu, 11 Dec 2025 11:53:00 +0100
Subject: [PATCH] inital test

---
 doble.exe | Bin 66873 -> 66873 bytes
 numbers.c |   8 +++++---
 2 files changed, 5 insertions(+), 3 deletions(-)

diff --git a/doble.exe b/doble.exe
index 2e1773233a9847c6ba09d757ba74e0c16403f4fa..8454e4e49af874e581cfa5b5daf130cbbb101034 100644
GIT binary patch
delta 22
ecmdnl#j>-DWkLtz@rj-OjOQC~ZoSEvzybhu2?_N8

delta 22
ecmdnl#j>-DWkLsI-^5OT#%YZ=x87t-U;zMdTnU2!

diff --git a/numbers.c b/numbers.c
index 9f33570..5fbd091 100644
--- a/numbers.c
+++ b/numbers.c
@@ -16,7 +16,7 @@
 // creating random numbers.
 
 //ohne Binärbaum
-/*unsigned int *createNumbers(unsigned int len)
+unsigned int *createNumbers(unsigned int len)
 {
   if (len <= 2)
     return NULL;
@@ -45,12 +45,14 @@
   numbers[rand()% len] = (rand()% (2* len) )+ 1;
   return numbers;
   free(numbers);
-}*/
+}
 
 int compare(const void *a, const void *b) {
     return (*(int*)a - *(int*)b);
 }
 //mit Binärbaum
+
+/*
 unsigned int *createNumbers(unsigned int len)
 {
   if (len <= 2)
@@ -81,7 +83,7 @@ unsigned int *createNumbers(unsigned int len)
   clearTree(root);
   free(numbers);
 }
-
+*/
 // Returns only the only number in numbers which is present twice. Returns zero on errors.
 unsigned int getDuplicate(const unsigned int numbers[], unsigned int len)
 {