just brew it! wrote:The native C++ boolean array was slower because C++ compilers don't normally pack boolean arrays as tightly as we did with the bit twiddling. The compiler will allocate a byte for each element, wasting 7 bits out of each byte. So for the sieve algorithm, you basically get clobbered on memory bandwidth.
Now *THAT* is weird
Now, correct me if I'm wrong, but didn't we use two digits for our clocks to cut down on memory use in the time that B/C was being created?
Memory was at a premium too... using eight times too much space is laughable in that respect
We have a 8th wonder of the world then IMO, :lol