.gitignore

@@ -4,6 +4,3 @@ doble_initial.exe
 runTests
 stack.o
 test_stack.o
-highscores.txt
-
-stack.o

numbers.c

@@ -5,7 +5,6 @@
 #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;
@@ -65,7 +64,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,8 +1,6 @@
 #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,7 +10,6 @@
 void test_createNumbers_length(void) {
   unsigned int *arr = createNumbers(TEST_ARRAY_LEN);
   TEST_ASSERT_NOT_NULL(arr);
-  
   free(arr);
 }