Algorithms in a Nutshell

References | 313 When All Else Fails No matter which question Victor asks Patti (for any flip of his coin), she can answer his q ...

314 Chapter 11. Epilogue........................................................................................................ ...

Principle: Decompose the Problem into Smaller Problems | 315 Epilogue If you are sorting data, there is no “one size fits all” a ...

(^316) | Chapter 11: Epilogue Problems often can be simply cut in half, leading to impressive performance savings. Consider how ...

Principle: Add Storage to Increase Performance | 317 Epilogue Principle: Add Storage to Increase Performance Many of the computa ...

(^318) | Chapter 11: Epilogue Sometimes an algorithm is unable to operate without some higher-than-expected storage. BUCKETSORTs ...

Principle: Writing Algorithms Is Hard—Testing Algorithms Is Harder | 319 Epilogue We show in Chapter 8 how to solve a single pro ...

(^320) | Chapter 11: Epilogue problem, either. We ultimately resorted to statistically checking theresults of these algorithms, ...

IV Appendix,Benchmarking Algorithms in a Nutshell Algorithms in a Nutshell By Gary Pollice, George T. Heineman, Stanley Selkow I ...

323 AppendixBenchmarking APPENDIX Benchmarking Each algorithm in this book is presented in its own section where you will find i ...

(^324) | Appendix: Benchmarking implementation of the algorithm. This may be suitable, for example, if it is too costly to compu ...

An Example | 325 Benchmarking Desktop PC We used a reasonable “home office” personal computer. This computer had a Pentium(R) 4 ...

(^326) | Appendix: Benchmarking TheTrialSuiteclass stores trials by their size. Once all trials have been added to the suite, th ...

An Example | 327 Benchmarking void execute( ) This method will contain the body of code to be timed. Thus there will always be a ...

(^328) | Appendix: Benchmarking Example A-4. compare.sh benchmarking script !/bin/bash This script expects TWO arguments: $1 -- ...

An Example | 329 Benchmarking compare.shmakes use of a small C program,eval, which computes the average and standard deviation u ...

(^330) | Appendix: Benchmarking Scheme Benchmarking Solutions The Scheme code in this section measures the performance of a seri ...

An Example | 331 Benchmarking The helper functions in Example A-6 are used by the timing code in Example A-7, which runs a serie ...

(^332) | Appendix: Benchmarking ThelargeAddfunction from Example A-8 adds together a set of n numbers. The output generated by(b ...

Reporting | 333 Benchmarking Reporting It is instructive to review the actual results when computed on the same platform, in thi ...