From c3b1cdd3a31de87ee7d68b27d8632b39bf8b5ca3 Mon Sep 17 00:00:00 2001
From: Max-R <reinleinm100423@th-nuernberg.de>
Date: Tue, 9 Dec 2025 10:37:20 +0100
Subject: [PATCH] numbers

---
 numbers.c | 2 +-
 numbers.h | 2 ++
 2 files changed, 3 insertions(+), 1 deletion(-)

diff --git a/numbers.c b/numbers.c
index 414a4a4..cdb270c 100644
--- a/numbers.c
+++ b/numbers.c
@@ -64,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;
 
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.