83 lines
1.9 KiB
C
83 lines
1.9 KiB
C
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <time.h>
|
|
#include <string.h>
|
|
#include "numbers.h"
|
|
#include "bintree.h"
|
|
|
|
//Speicher für Array erstellen, zufällige Zahlen von 1-2xlen erzeugen, mittels Binärbaum checken, ob Zahlen einzigartig sind
|
|
//Eine Zahl duplizieren, an zufälliger Stelle einfügen und die Zahl an der Stelle ans Ende schieben
|
|
const int compare (const void *a, const void *b);
|
|
|
|
unsigned int *createNumbers(unsigned int len)
|
|
{
|
|
unsigned int *numbers = malloc (sizeof(unsigned int) * len);
|
|
unsigned int upperLimit = len * 2;
|
|
int isDuplicate = 0;
|
|
TreeNode *binTree = NULL;
|
|
|
|
for (unsigned int i = 0; i < len; i++) {
|
|
do
|
|
{
|
|
isDuplicate = 0;
|
|
numbers[i] = rand () % upperLimit + 1;
|
|
binTree = addToTree(binTree, &numbers[i], sizeof(unsigned int), compare, &isDuplicate);
|
|
} while (isDuplicate);
|
|
}
|
|
|
|
unsigned int duplicate = numbers[rand () % len];
|
|
int indexDuplicate;
|
|
|
|
do {
|
|
indexDuplicate = rand() % len;
|
|
} while (numbers[indexDuplicate] == duplicate);
|
|
|
|
if (numbers[len-1] != duplicate) {
|
|
numbers[len-1] = numbers[indexDuplicate];
|
|
}
|
|
|
|
numbers[indexDuplicate] = duplicate;
|
|
|
|
clearTree(binTree);
|
|
|
|
return numbers;
|
|
}
|
|
|
|
//Vergleichsfunktion von qsort
|
|
const int compare (const void *a, const void *b) {
|
|
const unsigned int *x = a;
|
|
const unsigned int *y = b;
|
|
if (*x < *y) {
|
|
return -1;
|
|
}
|
|
else if (*x > *y) {
|
|
return 1;
|
|
}
|
|
else {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
//Sortiert Zahlen mit qsort, vergleicht dann benachbarte Elemente und gibt bei Erfolg die doppelte Zahl zurück
|
|
unsigned int getDuplicate(const unsigned int numbers[], unsigned int len)
|
|
{
|
|
if (len < 2) {
|
|
return 0;
|
|
}
|
|
|
|
unsigned int *copy = malloc (sizeof(unsigned int) * len);
|
|
memcpy (copy, numbers, sizeof(unsigned int) * len);
|
|
|
|
qsort(copy, len, sizeof(unsigned int), compare);
|
|
|
|
for (int i = 0; i < len-1; i++) {
|
|
if (copy[i] == copy [i+1]) {
|
|
unsigned int result = copy [i];
|
|
free (copy);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
free (copy);
|
|
return 0;
|
|
} |