Bit Twiddling Hacks
Popularity Report
 |
|||
|
|||
|
|||
|
|||
|
|||
|
Rank
URL Tag Cloud
- algorithms
- , bit
- , programming
- , algorithm
- , twiddling
- , hacks
- , c
- , code
- , hacking
- , binary
- , development
- , graphics
- , delicious
- , field
- , embedded
Bookmark History
Saved by 7 people (-3 private), first by anonymouse user on 2008-01-24
- Lite on 2008-01-31 - Tags bit , programming , algorithms , tips
- Yymikio on 2008-01-25 - Tags no_tag
- Mdgart on 2008-01-24 - Tags algorithm , algorithms , and , binary , c , code , development , graphics , hacks , hacking , twiddling , bit , programming
- Weijingzhu on 2008-01-24 - Tags no_tag
- Weijing on 2008-01-24 - Tags no_tag
Public Sticky notes
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.
Highlighted by joel
Public Comment