Writing Efficient ProgramsClassic on practical methods of optimizing programs: This book gives practical advice on improving the efficiency (optimizing) programs and the limits there of. While showing how to trade off speed for space or vice-versa, the author points out the limits that can be expected to gain. His list of techniques is a collection of practical approaches rather than theoretical possibilities. At 158 pages (not counting index) this book is eminently readable, accessable and useful. Clearly written and well organized this is a book to keep on your shelf for when a program needs improving. It is also a book to read before a program as a reminder not to make things complicated with optimization that aren't needed. |
From inside the book
Results 1-3 of 22
Page 124
... search did to make five hundred ! While each operation in the sequential search required just 4.1 microseconds , each of the log2 N steps of the binary search required ap- proximately 256 microseconds . It is clearly time to work on the ...
... search did to make five hundred ! While each operation in the sequential search required just 4.1 microseconds , each of the log2 N steps of the binary search required ap- proximately 256 microseconds . It is clearly time to work on the ...
Page 127
... binary search in a table of 1000 real numbers ; the cost of each of the log2 N operations has been reduced from 16 microseconds to 15 microseconds . Fragment 05 is about seventeen times faster than Fragment 01 ; while Fragment Ol ...
... binary search in a table of 1000 real numbers ; the cost of each of the log2 N operations has been reduced from 16 microseconds to 15 microseconds . Fragment 05 is about seventeen times faster than Fragment 01 ; while Fragment Ol ...
Page 131
... binary search program of a factor of more than 280 . One of the most important tools we used in this chapter is too often neglected by programmers : the literature search . Most programmers are clever people who enjoy solving problems ...
... binary search program of a factor of more than 280 . One of the most important tools we used in this chapter is too often neglected by programmers : the literature search . Most programmers are clever people who enjoy solving problems ...
Other editions - View all
Common terms and phrases
Algebraic Identities application array ArrPtr assembly code assembly language Bell Telephone Laboratories binary search BITBLT Bob Sproull boolean variable cache chapter CloseDist Computer Science coroutines cost data structures decrease described design levels element evaluation executed Expression Rule factor faster Fibonacci FORTRAN Fragment A9 function goto Hamburg Pascal high-level language implemented increase the speed inner loop input insertion sort instance instruction integer iteration Kernighan Knuth lazy evaluation log2 Logic Rule Loop Rule loop unrolling machine code memory ment microseconds modify node optimizations Pascal Pascal compiler Pascal program percent performance Plauger Precomputed Private communication problem procedure call Procedure Rule Quicksort real numbers recursive reduced the run routine Section sentinel sequential search shown in Fragment simple space Space-For-Time Rule speedup Sproull statement storage stored subroutine system-dependent efficiency techniques ThisDist Time-For-Space Rule transformations usually vector words writing efficient code