3. Test (vorerst) gelöscht

numbers.c

@@ -18,17 +18,23 @@ unsigned int *createNumbers(unsigned int len)
 
   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 = rand () % len;
+  int indexDuplicate;
-  numbers[len] = numbers[indexDuplicate];
-  numbers[indexDuplicate] = duplicate;
 
+  do {
+    indexDuplicate = rand() % len;
+  } while (numbers[indexDuplicate] == duplicate);
+
+  numbers[len-1] = numbers[indexDuplicate];
+  numbers[indexDuplicate] = duplicate;
+  
   return numbers;
 }
 

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();
 }