generated from freudenreichan/info2Praktikum-DobleSpiel
47 lines
1.4 KiB
C
47 lines
1.4 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.
|
|
unsigned int *createNumbers(unsigned int len)
|
|
{
|
|
unsigned int *array[len -1];
|
|
unsigned int position;
|
|
unsigned int duplicate;
|
|
unsigned int pos_dup;
|
|
|
|
srand(time(NULL));
|
|
|
|
for (unsigned int i = 1; i <= len; i++)
|
|
{
|
|
array[i-1] = rand() % (2*len) - 1;
|
|
}
|
|
|
|
//TODO: sicherstellen, dass im Array keine doppelten Zahlen vorhanden sind (Max)
|
|
|
|
position = rand() % len - 1;
|
|
duplicate = array[position];
|
|
pos_dup = rand() % len - 1;
|
|
|
|
if (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)
|
|
{
|
|
|
|
} |