(^28) | Chapter 2: The Mathematics of Algorithms
HighEnd-C-Last-O3 implementation,*as listed in the sixth column. The ratio of
the performance times is nearly two, as expected. Definet(n) to be the actual
running time of the ADDITIONalgorithm on an input of sizen. This growth
Figure 2-5. Comparing add and last in different scenarios
- That is, the C implementation oflastwhen compiled using –O3 optimization level and executed
on the high-end computer, as described in the appendix, which covers benchmarking.
Algorithms in a Nutshell
Algorithms in a Nutshell By Gary Pollice, George T. Heineman, Stanley Selkow ISBN:
9780596516246 Publisher: O'Reilly Media, Inc.
Prepared for Ming Yi, Safari ID: [email protected]
Licensed by Ming Yi
Print Publication Date: 2008/10/21 User number: 594243
© 2009 Safari Books Online, LLC. This PDF is made available for personal use only during the relevant subscription term, subject to the Safari Terms of Service. Any other use