kachelto100370/info2Praktikum-DobleSpiel
1
0
Fork 0
forked from freudenreichan/info2Praktikum-DobleSpiel
Code Pull Requests Activity

numbers

Browse Source
This commit is contained in:
Max-R 2025-12-09 10:37:20 +01:00
parent 9d32e06f3a
commit c3b1cdd3a3
2 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
numbers.c
View File

@ -64,7 +64,7 @@ unsigned int *createNumbers(unsigned int len) {
// Returns only the only number in numbers which is present twice. Returns zero // Returns only the only number in numbers which is present twice. Returns zero
// on errors. // 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) if (!numbers || len < 2)
return 0; return 0;

2
numbers.h
View File

@ -1,6 +1,8 @@
#ifndef NUMBERS_H #ifndef NUMBERS_H
#define 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 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 // Returns NULL on errors. Use your implementation of the binary search tree to check for possible duplicates while
// creating random numbers. // creating random numbers.