213 |
|
tree_root = tree_alloc(alen); |
214 |
|
|
215 |
|
while (alen > 0) /* allocate and print random array entries */ |
216 |
< |
print_shuf(n, eat_nth_leaf(tree_root, random() % alen--)); |
216 |
> |
print_shuf(n, eat_nth_leaf(tree_root, irandom(alen--))); |
217 |
|
|
218 |
|
free(tree_root); /* all done */ |
219 |
|
} |
251 |
|
myshuf[i] = i; |
252 |
|
/* perform Fisher-Yates shuffle */ |
253 |
|
for (i = 0; i < alen-1; i++) { |
254 |
< |
int ix = random()%(alen-i) + i; |
254 |
> |
int ix = irandom(alen-i) + i; |
255 |
|
int ndx = myshuf[i]; |
256 |
|
myshuf[i] = myshuf[ix]; |
257 |
|
myshuf[ix] = ndx; |