generated from freudenreichan/info2Praktikum-DobleSpiel
151 lines
3.2 KiB
C
151 lines
3.2 KiB
C
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <time.h>
|
|
#include <string.h>
|
|
#include "numbers.h"
|
|
#include "bintree.h"
|
|
|
|
//TODO: getDuplicate und createNumbers implementieren
|
|
/* * * * 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.
|
|
static int compareFct(const void *argument1, const void *argument2)
|
|
{
|
|
unsigned int x = *(const unsigned int *)argument1;
|
|
unsigned int y = *(const unsigned int *)argument2;
|
|
|
|
if (x < y) return -1;
|
|
if (x > y) return 1;
|
|
return 0;
|
|
}
|
|
|
|
static void fillArray(unsigned int *array, unsigned int len)
|
|
{
|
|
TreeNode *root = NULL;
|
|
int isDuplicate;
|
|
unsigned int value;
|
|
unsigned int i = 0;
|
|
|
|
srand(time(NULL));
|
|
|
|
while (i < len)
|
|
{
|
|
value = rand() % (2 * len) + 1;
|
|
|
|
root = addToTree(root, &value, sizeof(unsigned int), compareFct, &isDuplicate);
|
|
|
|
if (isDuplicate == 0)
|
|
{
|
|
array[i] = value;
|
|
i++;
|
|
}
|
|
// Bei Duplikat: nochmal versuchen, kein Inkrement
|
|
}
|
|
|
|
clearTree(root);
|
|
}
|
|
|
|
|
|
unsigned int *createNumbers(unsigned int len)
|
|
{
|
|
if (len < 2)
|
|
{
|
|
fprintf(stderr,"Fehler! Die Anzahl an Zahlen muss mindestens 2 sein!\n");
|
|
return NULL;
|
|
}
|
|
|
|
unsigned int *array = malloc(sizeof(unsigned int) * len);
|
|
|
|
if (array == NULL)
|
|
{
|
|
fprintf(stderr,"Fehler! Der Speicher für das Array konnte nicht reserviert werden!\n");
|
|
return NULL;
|
|
}
|
|
|
|
unsigned int position;
|
|
unsigned int duplicate_value;
|
|
unsigned int pos_dup;
|
|
|
|
|
|
srand(time(NULL));
|
|
|
|
/*for (unsigned int i = 0; i < len; i++)
|
|
{
|
|
array[i] = rand() % (2*len) + 1;
|
|
}
|
|
|
|
*/
|
|
|
|
TreeNode *root = NULL;
|
|
int isDuplicate;
|
|
unsigned int value;
|
|
unsigned int i = 0;
|
|
|
|
srand(time(NULL));
|
|
|
|
while (i < len)
|
|
{
|
|
value = rand() % (2 * len) + 1;
|
|
|
|
root = addToTree(root, &value, sizeof(unsigned int), compareFct, &isDuplicate);
|
|
|
|
if (isDuplicate == 0)
|
|
{
|
|
array[i] = value;
|
|
i++;
|
|
}
|
|
// Bei Duplikat: nochmal versuchen, kein Inkrement
|
|
}
|
|
|
|
clearTree(root);
|
|
|
|
|
|
|
|
position = rand() % len;
|
|
duplicate_value = array[position];
|
|
|
|
do
|
|
{
|
|
pos_dup = rand() % len;
|
|
} while (pos_dup == position);
|
|
|
|
array[pos_dup] = array[position];
|
|
|
|
return array;
|
|
}
|
|
|
|
// 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 duplicate = 0;
|
|
|
|
if (numbers == NULL)
|
|
{
|
|
fprintf(stderr, "Fehler! Das übergebene Array ist leer!\n");
|
|
return duplicate;
|
|
}
|
|
|
|
if (len < 2)
|
|
{
|
|
fprintf(stderr,"Fehler! Die Anzahl an Zahlen muss mindestens 2 sein!\n");
|
|
return duplicate;
|
|
}
|
|
|
|
for (unsigned int i = 0; i < len - 1; i++)
|
|
{
|
|
for (unsigned int k = i + 1; k < len; k++)
|
|
{
|
|
if (numbers[i] == numbers[k])
|
|
{
|
|
duplicate = numbers[k];
|
|
return duplicate;
|
|
}
|
|
}
|
|
}
|
|
|
|
return duplicate;
|
|
} |