freudenreichan/info2Praktikum-DobleSpiel
Template
1
1
Fork 11
Code Issues 1 Pull Requests 2 Packages Projects Releases Wiki Activity

numbers.c finished

Browse Source
This commit is contained in:
Fabrice 2025-12-05 09:28:40 +01:00
parent 74b541a1a0
commit a816abfe04
1 changed files with 24 additions and 36 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

60
numbers.c
View File

@ -5,46 +5,33 @@
#include "numbers.h" #include "numbers.h"
#include "bintree.h" #include "bintree.h"
//TODO: getDuplicate und createNumbers implementieren //Speicher für Array erstellen, zufällige Zahlen von 1-2xlen erzeugen, mittels Binärbaum checken, ob Zahlen einzigartig sind
/* * * Erzeugen eines Arrays mit der vom Nutzer eingegebenen Anzahl an Zufallszahlen. //Eine Zahl duplizieren, an zufälliger Stelle einfügen und die Zahl an der Stelle ans Ende schieben
* Sicherstellen, dass beim Befüllen keine Duplikate entstehen.
* Duplizieren eines zufälligen Eintrags im Array.
* in `getDuplicate()`: Sortieren des Arrays und Erkennen der doppelten Zahl durch Vergleich benachbarter Elemente. */
// 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.
unsigned int *createNumbers(unsigned int len) unsigned int *createNumbers(unsigned int len)
{ {
srand(time(NULL)); unsigned int *numbers = malloc (sizeof(unsigned int) * len);
unsigned int upperLimit = len * 2;
unsigned int *numbers = malloc (sizeof(unsigned int) * (len+1)); int isDuplicate = 0;
unsigned int newNumber; TreeNode *binTree = NULL;
for (unsigned int i = 0; i < len; i++) { for (unsigned int i = 0; i < len; i++) {
int unique = 0; do
{
numbers[i] = rand () % upperLimit + 1;
binTree = addToTree(binTree, &numbers[i], sizeof(unsigned int), compare, &isDuplicate);
} while (isDuplicate);
}
while (!unique) { unsigned int duplicate = numbers[rand () % len];
unique = 1; int indexDuplicate = rand () % len;
newNumber = rand () % (2*len) + 1; numbers[len] = numbers[indexDuplicate];
numbers[indexDuplicate] = duplicate;
for (unsigned int j = 0; j < i; j++) {
if (numbers[j] == newNumber) {
unique = 0;
break;
}
}
}
numbers[i] = newNumber;
}
unsigned int duplicate = numbers[rand () % len];
numbers[len] = duplicate;
return numbers; return numbers;
} }
int compare (const void *a, const void *b) { //Vergleichsfunktion von qsort
const int compare (const void *a, const void *b) {
unsigned int *x = a; unsigned int *x = a;
unsigned int *y = b; unsigned int *y = b;
if (*x < *y) { if (*x < *y) {
@ -57,16 +44,17 @@ int compare (const void *a, const void *b) {
return 0; return 0;
} }
} }
// Returns only the only number in numbers which is present twice. Returns zero on errors.
unsigned int getDuplicate(unsigned int numbers[], unsigned int lenPlusOne) //Sortiert Zahlen mit qsort, vergleicht dann benachbarte Elemente und gibt bei Erfolg die doppelte Zahl zurück
unsigned int getDuplicate(unsigned int numbers[], unsigned int len)
{ {
if (lenPlusOne < 2) { if (len < 2) {
return 0; return 0;
} }
qsort(numbers,lenPlusOne, sizeof(unsigned int), compare); qsort(numbers, len, sizeof(unsigned int), compare);
for (int i = 0; i < lenPlusOne-1; i++) { for (int i = 0; i < len-1; i++) {
if (numbers[i] == numbers [i+1]) { if (numbers[i] == numbers [i+1]) {
return numbers[i]; return numbers[i];
} }