generated from freudenreichan/info2Praktikum-DobleSpiel
81 lines
2.1 KiB
C
81 lines
2.1 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
|
|
/* * * Erzeugen eines Arrays mit der vom Nutzer eingegebenen Anzahl an Zufallszahlen.
|
|
* 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)
|
|
{
|
|
srand(time(NULL));
|
|
unsigned int* numbers =malloc(sizeof(unsigned int) * len);
|
|
unsigned int numberTemp;
|
|
//unsigned int* numbTempPtr = &numberTemp;
|
|
int generated = 0;
|
|
int isDuplicate = 0;
|
|
TreeNode* root = NULL;
|
|
|
|
if(numbers == NULL)return NULL;
|
|
|
|
|
|
while(generated<len){
|
|
|
|
numberTemp = (rand() % (2*len))+1;
|
|
|
|
isDuplicate = 0;
|
|
|
|
root = addToTree( root, &numberTemp, sizeof(unsigned int), compareFct, &isDuplicate );
|
|
|
|
if(!isDuplicate){
|
|
|
|
numbers[generated] = numberTemp;
|
|
generated++;
|
|
}
|
|
}
|
|
|
|
|
|
int DuplicateId;
|
|
int DuplicatePlace;
|
|
|
|
do{
|
|
DuplicateId = rand() % len;
|
|
DuplicatePlace = rand() % len;
|
|
}while(DuplicateId == DuplicatePlace);
|
|
|
|
numbers[DuplicatePlace] = numbers[DuplicateId];
|
|
|
|
clearTree(root);
|
|
|
|
return numbers;
|
|
}
|
|
|
|
// 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;
|
|
unsigned int* numbersCopy = malloc(sizeof(unsigned int) * len);
|
|
|
|
if(numbersCopy == NULL)return 0;
|
|
|
|
|
|
memcpy(numbersCopy, numbers, sizeof(unsigned int) * len);
|
|
|
|
qsort(numbersCopy, len, sizeof(unsigned int), compareFct);
|
|
|
|
for(int i=1; i<len; i++){
|
|
if(numbersCopy[i-1]==numbersCopy[i])duplicate = numbersCopy[i];
|
|
}
|
|
|
|
free(numbersCopy);
|
|
|
|
return duplicate;
|
|
} |