Compare commits
5
Commits
bintree
...
93a818088c
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
93a818088c
|
||
|
|
2e805ba8e6 | ||
|
|
2d3ffcf3f8 | ||
|
|
aa3538c14b | ||
|
|
a4a60a3d95 |
@@ -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;
|
||||
numbers[len] = numbers[indexDuplicate];
|
||||
numbers[indexDuplicate] = duplicate;
|
||||
int indexDuplicate;
|
||||
|
||||
do {
|
||||
indexDuplicate = rand() % len;
|
||||
} while (numbers[indexDuplicate] == duplicate);
|
||||
|
||||
numbers[len-1] = numbers[indexDuplicate];
|
||||
numbers[indexDuplicate] = duplicate;
|
||||
|
||||
return numbers;
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user