3. Test (vorerst) gelöscht

Reviewed-on: #1

bintree.c

@@ -1,7 +1,6 @@
 #include <string.h>
 #include "stack.h"
 #include "bintree.h"
-#include <stdlib.h>
 
 //TODO: binären Suchbaum implementieren
 /*  * `addToTree`: fügt ein neues Element in den Baum ein (rekursiv),
@@ -13,70 +12,7 @@
 // if isDuplicate is NULL, otherwise ignores duplicates and sets isDuplicate to 1 (or to 0 if a new entry is added).
 TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, CompareFctType compareFct, int *isDuplicate)
 {
-    TreeNode *insertedNode;
 
-    // create a new node if the current node is NULL
-    if (root == NULL)
-    {
-        // it's important to zero the pointers for adjacent nodes
-        insertedNode = calloc(1, sizeof(TreeNode));
-        if (!insertedNode)
-        {
-            return NULL;
-        }
-
-        insertedNode->data = malloc(dataSize);
-        if (!insertedNode->data)
-        {
-            return NULL;
-        }
-        memcpy(insertedNode->data, data, dataSize);
-        // reset isDuplicate if it exists
-        if (isDuplicate)
-        {
-            *isDuplicate = 0;
-        }
-        return insertedNode;
-    }
-
-    // TODO: what is the correct data type here?
-    int cmpRes = (*compareFct)(data, root->data);
-    // insert into the left branch
-    if (cmpRes < 0 || (cmpRes == 0 && isDuplicate == NULL))
-    {
-        root->left = addToTree(root->left, data, dataSize, compareFct, isDuplicate);
-    }
-    // insert into the right branch
-    else if (cmpRes > 0)
-    {
-        root->right = addToTree(root->right, data, dataSize, compareFct, isDuplicate);
-    }
-    // the data is equal to the current node
-    else
-    {
-        // the data already exists in the tree and duplicates are ignored (isDuplicate* not NULL)
-        *isDuplicate = 1;
-    }
-    return root;
-}
-
-// push all left descendants from @param node
-static void pushLeftDesc(StackNode **stackPtr, TreeNode *node)
-{
-    if (!stackPtr || !node)
-    {
-        return;
-    }
-    TreeNode *curNode = node;
-    while (curNode->left)
-    {
-        *stackPtr = push(*stackPtr, curNode->left);
-        if (!*stackPtr)
-        {
-            return;
-        }
-        curNode = curNode->left;
-    }
 }
 
 // Iterates over the tree given by root. Follows the usage of strtok. If tree is NULL, the next entry of the last tree given is returned in ordering direction.
@@ -84,72 +20,17 @@ static void pushLeftDesc(StackNode **stackPtr, TreeNode *node)
 // push the top node and push all its left nodes.
 void *nextTreeData(TreeNode *root)
 {
-    // this creates a static variable that maintains an internal state
-    static StackNode *stack;
 
-    // create a new stack
-    if (root)
-    {
-        // clear possibly existing stacks
-        clearStack(stack);
-        // init a new stack
-        stack = push(NULL, root);
-        // init failed
-        if (!stack)
-        {
-            return NULL;
-        }
-        pushLeftDesc(&stack, root);
-
-        // return the first val
-        return nextTreeData(NULL);
-    }
-
-    // neither stack nor root exist
-    if (!stack)
-    {
-        return NULL;
-    }
-
-    // get next val with stack
-    TreeNode *res = top(stack);
-    stack = pop(stack);
-    if (res->right)
-    {
-        stack = push(stack, res->right);
-        pushLeftDesc(&stack, res->right);
-    }
-
-    return res->data;
 }
 
 // Releases all memory resources (including data copies).
 void clearTree(TreeNode *root)
 {
-    // this check is crucial for recursion
-    if (!root)
-    {
-        // nothing to clear
-        return;
-    }
 
-    // release the resources of child nodes first
-    clearTree(root->left);
-    clearTree(root->right);
-
-    // free the data (it's just a copy created in addToTree())
-    free(root->data);
-    free(root);
 }
 
 // Returns the number of entries in the tree given by root.
 unsigned int treeSize(const TreeNode *root)
 {
-    // there are no nodes
-    if (!root)
-    {
-        return 0;
-    }
 
-    return 1 + treeSize(root->left) + treeSize(root->right);
 }

main.c

@@ -71,7 +71,7 @@ int main(int argc, char *argv[])
         userInput = inputNumber("Welche Zahl kommt doppelt vor: ");
         measuredSeconds = stopTimer();
 
-        duplicate = getDuplicate(numbers, numberOfElements);
+        duplicate = getDuplicate(numbers, numberOfElements+1);
 
         // check result and update highscores
         if(userInput == duplicate)

numbers.c

@@ -5,87 +5,67 @@
 #include "numbers.h"
 #include "bintree.h"
 
-static int compareInt(const void *ptr1, const void *ptr2);
+//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);
 
-// 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. */
-
-// 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.
-
-/*
-the implemented tree can't efficiently check if it contains a specific number, but we don't actually need that anyways
-create numbers just counts and checks if the just inserted number sets the isDuplicate pointer
-*/
-// srand should have been called before this function
 unsigned int *createNumbers(unsigned int len)
 {
-  unsigned int *randomNumbers = malloc(len * sizeof(int));
+  unsigned int *numbers = malloc (sizeof(unsigned int) * len);
-
+  unsigned int upperLimit = len * 2;
-  if (!randomNumbers)
-  {
-    return NULL;
-  }
-
-  // including upper limit
-  int upperLimit = len * 2;
-
-  int numberCnt = 0;
-
   int isDuplicate = 0;
-  TreeNode *root = NULL;
+  TreeNode *binTree = NULL;
-  // we only need len-1 numbers because 1 will be duplicated
+
-  while (numberCnt < len - 1)
+  for (unsigned int i = 0; i < len; i++) {
+    do
     {
-    // numbers up to and including upperLimit without 0
-    int randNum = rand() % upperLimit + 1;
-    // reset isDuplicate
       isDuplicate = 0;
-    // don't forget to set the root here
+      numbers[i] = rand () % upperLimit + 1;
-    root = addToTree(root, &randNum, sizeof(randNum), (CompareFctType)compareInt, &isDuplicate);
+      binTree = addToTree(binTree, &numbers[i], sizeof(unsigned int), compare, &isDuplicate);
-    if (isDuplicate)
+    } while (isDuplicate);
-    {
-      // number already exists
-      continue;
-    }
-    randomNumbers[numberCnt++] = randNum;
   } 
 
-  // select which number to duplicate
+  unsigned int duplicate = numbers[rand () % len];
-  int dupNum = randomNumbers[rand() % numberCnt];
+  int indexDuplicate;
-  // ...and where to insert
-  int dupNumIdx = rand() % len;
 
-  // move the number currently at the dupNumIdx to the end
+  do {
-  // and insert the dupNum at the index
+    indexDuplicate = rand() % len;
-  // this also works if the last idx was selected for dupNum
+  } while (numbers[indexDuplicate] == duplicate);
-  randomNumbers[len - 1] = randomNumbers[dupNumIdx];
-  randomNumbers[dupNumIdx] = dupNum;
 
-  // clean up memory
+  numbers[len-1] = numbers[indexDuplicate];
-  clearTree(root);
+  numbers[indexDuplicate] = duplicate;
-  return randomNumbers;
+  
+  return numbers;
 }
 
-// Returns only the only number in numbers which is present twice. Returns zero on errors.
+//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)
 {
-  qsort((void *)numbers, len, sizeof(int), compareInt); // sort the array
+  if (len < 2) {
-  for (int i = 0; i < len - 1; i++)
+    return 0;
-  {
-    if (numbers[i] == numbers[i + 1])
-      return numbers[i];
-  }
-  return 0; // zero on errors
   }
 
-static int compareInt(const void *ptr1, const void *ptr2)
+qsort((void*)numbers, len, sizeof(unsigned int), compare);
-{
+
-  int num1 = *(int *)ptr1;
+for (int i = 0; i < len-1; i++) {
-  int num2 = *(int *)ptr2;
+  if (numbers[i] == numbers [i+1]) {
-  return num1 - num2;
+    return numbers[i];
+  }
+}
+  return 0;
 }

test_numbers.c

@@ -46,5 +46,6 @@ int main(void)
     UNITY_BEGIN();
     RUN_TEST(test_get_duplicate_error);
     RUN_TEST(test_for_triple);
+    
     return UNITY_END();
 }