48 lines
1.4 KiB
C
48 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
|
|
/* * * 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. */
|
|
int compareFct(const void *a, const void *b)
|
|
{
|
|
return *(int*)a - *(int*)b;
|
|
}
|
|
|
|
// 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)
|
|
{
|
|
TreeNode *root = NULL;
|
|
unsigned int* numbers = malloc(len * sizeof(unsigned int));
|
|
srand(time(NULL));
|
|
while(treeSize(root)<len)
|
|
{
|
|
unsigned int zahl = rand()%(2*len-1)+1;
|
|
addToTree(root, &zahl, sizeof(zahl),compareFct,0);
|
|
}
|
|
nextTreeData(root);
|
|
for(int i=0;i<len;i++)
|
|
{
|
|
|
|
nextTreeData(NULL);
|
|
}
|
|
unsigned int duplicate = rand()%(len-1)+1;
|
|
|
|
|
|
|
|
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)
|
|
{
|
|
|
|
} |