poppni99154/Doblespiel
1
0
Fork 0
generated from freudenreichan/info2Praktikum-DobleSpiel
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Test

Browse Source
This commit is contained in:
Niklas Popp 2025-12-11 16:55:04 +01:00
parent 5c049f0f92
commit 492003fc03
2 changed files with 49 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
doblespiel/.idea/workspace.xml generated
View File

@ -18,10 +18,11 @@
</component> </component>
<component name="ChangeListManager"> <component name="ChangeListManager">
<list default="true" id="b1c3e940-935f-411e-990c-fffd90e19b9e" name="Changes" comment="Test"> <list default="true" id="b1c3e940-935f-411e-990c-fffd90e19b9e" name="Changes" comment="Test">
<change afterPath="$PROJECT_DIR$/timer.c" afterDir="false" />
<change beforePath="$PROJECT_DIR$/../Spiel_Aufgabenstellung.pdf" beforeDir="false" /> <change beforePath="$PROJECT_DIR$/../Spiel_Aufgabenstellung.pdf" beforeDir="false" />
<change beforePath="$PROJECT_DIR$/../bintree.c" beforeDir="false" /> <change beforePath="$PROJECT_DIR$/../bintree.c" beforeDir="false" />
<change beforePath="$PROJECT_DIR$/../bintree.h" beforeDir="false" /> <change beforePath="$PROJECT_DIR$/../bintree.h" beforeDir="false" />
<change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
<change beforePath="$PROJECT_DIR$/numbers.c" beforeDir="false" afterPath="$PROJECT_DIR$/numbers.c" afterDir="false" />
<change beforePath="$PROJECT_DIR$/../highscore.c" beforeDir="false" /> <change beforePath="$PROJECT_DIR$/../highscore.c" beforeDir="false" />
<change beforePath="$PROJECT_DIR$/../highscore.h" beforeDir="false" /> <change beforePath="$PROJECT_DIR$/../highscore.h" beforeDir="false" />
<change beforePath="$PROJECT_DIR$/../highscores.txt" beforeDir="false" /> <change beforePath="$PROJECT_DIR$/../highscores.txt" beforeDir="false" />
@ -71,7 +72,7 @@
"keyToString": { "keyToString": {
"C/C++ File.main.c (1).executor": "Run", "C/C++ File.main.c (1).executor": "Run",
"C/C++ File.main.c - MinGW.executor": "Run", "C/C++ File.main.c - MinGW.executor": "Run",
"C/C++ File.main.c.executor": "Profiler", "C/C++ File.main.c.executor": "Run",
"RunOnceActivity.RadMigrateCodeStyle": "true", "RunOnceActivity.RadMigrateCodeStyle": "true",
"RunOnceActivity.ShowReadmeOnStart": "true", "RunOnceActivity.ShowReadmeOnStart": "true",
"RunOnceActivity.cidr.known.project.marker": "true", "RunOnceActivity.cidr.known.project.marker": "true",
@ -120,7 +121,7 @@
<workItem from="1765293357084" duration="4517000" /> <workItem from="1765293357084" duration="4517000" />
<workItem from="1765396896305" duration="704000" /> <workItem from="1765396896305" duration="704000" />
<workItem from="1765458844634" duration="11000" /> <workItem from="1765458844634" duration="11000" />
<workItem from="1765459125768" duration="939000" /> <workItem from="1765459125768" duration="6792000" />
</task> </task>
<task id="LOCAL-00001" summary="Test"> <task id="LOCAL-00001" summary="Test">
<option name="closed" value="true" /> <option name="closed" value="true" />

45
doblespiel/numbers.c
View File

@ -14,13 +14,58 @@
// 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.
void createnumbers2(int array[], int length)
{
for (int i =0; i < length; i++)
{
array[i] = rand() % 9 +1;
for (int j = 0; j < i;j++)
{
if( array[j] == array[i] )
{
array[i] = rand() % 9 +1;
}
}
}
}
unsigned int *createNumbers(unsigned int len) unsigned int *createNumbers(unsigned int len)
{ {
srand(time(NULL));
int array[len];
createnumbers2(array, len);
int zufall =0;
zufall = rand() % (len+1) + 0;
array[0] = array[zufall];
return array; //was soll zurückgegeben werden?
} }
// 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)
{ {
//geht nicht, weil array nur lesen möglich?
for (int i = 0; i < len; i++)
{
for (int j = 0; j < len-1; j++)
{
if (numbers[i] < numbers[j])
{
int temp = numbers[i];
numbers[i] = numbers[j];
numbers[j] = temp;
}
if (numbers[i] == numbers[j])
{
return numbers[i];
}
}
}
} }