Compare commits
No commits in common. "19da93680c0de6201afb0eaa16a6b53fde435b5f" and "4825bbab4381c5ce166f68e9dcb43c7805d751ee" have entirely different histories.
19da93680c
...
4825bbab43
33
numbers.c
33
numbers.c
@ -17,41 +17,10 @@
|
||||
unsigned int *createNumbers(unsigned int len)
|
||||
{
|
||||
|
||||
int n;
|
||||
printf("Wie viele Zufallszahlen sollen erstellt werden? ");
|
||||
scanf("%d", &n);
|
||||
|
||||
int array[n];
|
||||
srand(time(NULL)); // Zufallsgenerator initialisieren
|
||||
|
||||
for (int i = 0; i < n; i++)
|
||||
{
|
||||
int zahl;
|
||||
char vorhanden;
|
||||
|
||||
do
|
||||
{
|
||||
vorhanden = 0;
|
||||
zahl = rand() % n; // Zufallszahl zwischen 1 und 100
|
||||
|
||||
// Prüfen, ob Zahl schon im Array existiert
|
||||
for (int j = 0; j < i; j++)
|
||||
{
|
||||
if (array[j] == zahl)
|
||||
{
|
||||
vorhanden = 1;
|
||||
break;
|
||||
}
|
||||
}
|
||||
} while (vorhanden); // solange wiederholen, bis Zahl einzigartig ist
|
||||
|
||||
array[i] = zahl;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
// 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)
|
||||
{
|
||||
|
||||
}
|
||||
Loading…
x
Reference in New Issue
Block a user