Well, the random generator is very simple. For each second passed, the seed seems to grow exactly by one. Second, %d is for integers, not for time_ts. It might not be _very_ portable. The new scope.. I can't tell whether it's a good idea or not. It probably is. The algorithm is fine, as I'm using it, too.
Note that "0u - 1 + 0.0" is a complicated way of saying "(double)UINT_MAX". It has the disadvantage of yielding undefined behavior, as the value of "0u - 1" is not defined.
The binary search implementation looks ok at first sight.
If time_t happens to be an integral type of size > sizeof(unsigned int), the seed grows by one every two seconds.Originally Posted by Brafil
Greets,
Philip
All things begin as source code.
Source code begins with an empty file.
-- Tao Te Chip
