BitTwiddle - Your daily bit twiddle fortune.
___[ Contribute ]
Want to share your BitTwiddles?
HTML Show them to use on irc.bitreich.org/#bitreich-en!
___[ Twiddle ]
About the operation counting methodology
When totaling the number of operations for algorithms here, any C operator is
counted as one operation. Intermediate assignments, which need not be written to
RAM, are not counted. Of course, this operation counting approach only serves as
an approximation of the actual number of machine instructions and CPU time. All
operations are assumed to take the same amount of time, which is not true in
reality, but CPUs have been heading increasingly in this direction over time.
There are many nuances that determine how fast a system will run a given sample
of code, such as cache sizes, memory bandwidths, instruction sets, etc. In the
end, benchmarking is the best way to determine whether one method is really
faster than another, so consider the techniques below as possibilities to test
on your target architecture.
================================
The twiddles are from various sources. See:
DIR Fortune twiddles.
DIR Twiddle scripts.
DIR << back to bitreich.org