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 92
Page 4
Jon Louis Bentley. an efficient system . Unfortunately , efficiency is rarely ... code possible , then theoretical results tell us that the problem cannot be ... Writing Efficient Code . The activity of writing efficient code takes as in ...
Jon Louis Bentley. an efficient system . Unfortunately , efficiency is rarely ... code possible , then theoretical results tell us that the problem cannot be ... Writing Efficient Code . The activity of writing efficient code takes as in ...
Page 6
... writing efficient code , yet there is little written about the subject in most discussions of efficiency in software sys- tems . The purpose of this book is to describe this activity to software engineers concerned with efficiency . In ...
... writing efficient code , yet there is little written about the subject in most discussions of efficiency in software sys- tems . The purpose of this book is to describe this activity to software engineers concerned with efficiency . In ...
Page 8
... writing efficient code ; these are listed in their indices under the headings “ algorithm ” , “ efficiency ” , “ optimization ” , “ running time ” , and “ time complexity " , among others . Kreitzberg and Shneiderman [ 1972 , Chapters 2 ...
... writing efficient code ; these are listed in their indices under the headings “ algorithm ” , “ efficiency ” , “ optimization ” , “ running time ” , and “ time complexity " , among others . Kreitzberg and Shneiderman [ 1972 , Chapters 2 ...
Other editions - View all
Common terms and phrases
achieve algorithms and data application array ArrPtr assembly code assembly language Bell Telephone Laboratories binary search Bob Sproull boolean variable cache Chapter CloseDist ClosePt Computer Science coroutines cost data structures decrease described design levels element evaluation example executed Expression Rule factor faster ficient FORTRAN Fragment A9 function goto Hamburg Pascal hardware high-level language IBM System/360 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 microseconds modify node NumPts optimizations Pascal Pascal compiler Pascal program percent performance Precomputed problem procedure call Procedure Rule PtPtr Quicksort real numbers recursive reduced the run routine Section sentinel sequential search shown in Fragment sorting space Space-For-Time Rule speedup statement stored subroutine techniques ThisDist ThisPt Time-For-Space Rule transformations usually writing efficient code