Bit Twiddling Hacks

时间:2015-12-04 07:54:06
【文件属性】:

文件名称:Bit Twiddling Hacks

文件大小:119KB

文件格式:PDF

更新时间:2015-12-04 07:54:06

C++

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.


网友评论