small fix in numbers

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;
 

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.

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);
 }