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.
Ads by Google
1Expand
Analyzing the AI Bot Library from the Quake 3 Source Code — AiGameDev.com
more fromaigamedev.com
Index of /repos/ftsearch/
more fromeigenclass.org
PLEAC-Ruby
more frompleac.sourceforge.net
HANDY ONE-LINERS FOR RUBY
more fromwww.fepus.net
ruby code
more fromwww.bigbold.com
Programming in C
more fromwww.cs.cf.ac.uk
Notation: * = Private bookmark and comment|… = Clipping [?] | … = Public highlight [?]
Joel Liu's Related Tags
Selected tags
Related tags
See More Top Contributors
Related Groups on Diigo
Related Lists on Diigo
-
Content Management Systems
for frupal, joomla and othe...
Items: 0 | Visits: 78
Created by: igmuska .
-
iXLd.com
Web strategy specialists ac...
Items: 4 | Visits: 92
Created by: Ma Theresa Camartin
-
Cashes.com
make money, Google adsense,...
Items: 0 | Visits: 62
Created by: kangdeockho