diff --git a/numbers.c b/numbers.c
index 414a4a4..4e11951 100644
--- a/numbers.c
+++ b/numbers.c
@@ -5,6 +5,7 @@
 #include <string.h>
 #include <time.h>
 
+//Vergleicht 
 int compareUnsignedInt(const void *a, const void *b) {
   unsigned int x = *(unsigned int *)a;
   unsigned int y = *(unsigned int *)b;
@@ -64,7 +65,7 @@ unsigned int *createNumbers(unsigned int len) {
 
 // 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) {
+unsigned int getDuplicate(const unsigned int *numbers, unsigned int len) {
   if (!numbers || len < 2)
     return 0;
 
diff --git a/numbers.h b/numbers.h
index 2315581..f3764e6 100644
--- a/numbers.h
+++ b/numbers.h
@@ -1,6 +1,8 @@
 #ifndef NUMBERS_H
 #define NUMBERS_H
 
+int compareUnsignedInt(const void *a, const void *b);
+
 // Returns len random numbers between 1 and 2x len in random order which are all different, except for two entries.
 // Returns NULL on errors. Use your implementation of the binary search tree to check for possible duplicates while
 // creating random numbers.
diff --git a/stack.o b/stack.o
deleted file mode 100644
index 177a3f5..0000000
Binary files a/stack.o and /dev/null differ
diff --git a/test_numbers.c b/test_numbers.c
index 8992bb8..51118e2 100644
--- a/test_numbers.c
+++ b/test_numbers.c
@@ -10,6 +10,7 @@
 void test_createNumbers_length(void) {
   unsigned int *arr = createNumbers(TEST_ARRAY_LEN);
   TEST_ASSERT_NOT_NULL(arr);
+  
   free(arr);
 }
 
diff --git a/test_stack.o b/test_stack.o
deleted file mode 100644
index 7332b5b..0000000
Binary files a/test_stack.o and /dev/null differ