generated from freudenreichan/info2Praktikum-DobleSpiel
createNumbers first draft
This commit is contained in:
1 parent
d74cfc2ab7
commit
51e5ba0db6
1 file changed
+56
@@ -14,11 +14,67 @@
|
|||||||
// Returns len random numbers between 1 and 2x len in random order which are all different, except for two entries.
|
// 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
|
// Returns NULL on errors. Use your implementation of the binary search tree to check for possible duplicates while
|
||||||
// creating random numbers.
|
// creating random numbers.
|
||||||
|
|
||||||
|
|
||||||
|
static unsigned int randNumExists(unsigned int randNum, TreeNode *node){
|
||||||
|
unsigned int randExists = 0;
|
||||||
|
while(node != NULL || node->left != NULL || node->right != NULL){
|
||||||
|
if(node->data == randNum){
|
||||||
|
randExists = 1;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
if(randNum < node->data){
|
||||||
|
node = node->left;
|
||||||
|
}
|
||||||
|
else{
|
||||||
|
node = node->right;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
unsigned int *createNumbers(unsigned int len)
|
unsigned int *createNumbers(unsigned int len)
|
||||||
{
|
{
|
||||||
|
srand(time(NULL));
|
||||||
|
int randomNumber = rand() % len + len;
|
||||||
|
TreeNode randRoot;
|
||||||
|
randRoot.data = randomNumber;
|
||||||
|
randRoot.left = NULL;
|
||||||
|
randRoot.right = NULL;
|
||||||
|
unsigned int randomNumbers[len];
|
||||||
|
randomNumbers[0] = randRoot.data;
|
||||||
|
int i = 1;
|
||||||
|
int pairExists = 0;
|
||||||
|
while(i < len-1){
|
||||||
|
randomNumber = rand() % len + len;
|
||||||
|
if(!randNumExists(randomNumber, &randRoot)){
|
||||||
|
randomNumbers[i++] = randomNumber;
|
||||||
|
}
|
||||||
|
else{
|
||||||
|
if(!pairExists){
|
||||||
|
randomNumbers[i++] = randomNumber;
|
||||||
|
pairExists = 1;
|
||||||
|
}
|
||||||
|
else{
|
||||||
|
{
|
||||||
|
randomNumber = rand() % len + len;
|
||||||
|
}while(randNumExists(randomNumber));
|
||||||
|
randomNumbers[i++] = randomNumber;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if(!pairExists){
|
||||||
|
randomNumbers[len-1] = randomNumbers[rand() % (len-1)];
|
||||||
|
}
|
||||||
|
else{
|
||||||
|
randomNumbers[len-1] = rand() % len + len;
|
||||||
|
}
|
||||||
|
|
||||||
|
return randomNumbers;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
// Returns only the only number in numbers which is present twice. Returns zero on errors.
|
// 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 getDuplicate(const unsigned int numbers[], unsigned int len)
|
||||||
{
|
{
|
||||||
|
|||||||
Reference in new issue
Block a user