Writing efficient programs |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Common terms and phrases
achieve Algebraic Identities algorithms and data application array ArrPtr assembly code assembly language begin binary search Bob Sproull boolean variable cache Chapter CloseDist ClosePt coroutines cost data structures decrease described design levels element evaluation example executed Exercise Exploit Expression Rule factor faster Fibonacci FORTRAN Fragment A9 function goto hardware high-level language HighPt IBM System/360 implementation 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 ment microseconds modified node NumPts object code operations optimizations Pascal Pascal program percent performance Precomputed problem Procedure Rule PtPtr Quicksort real numbers recursive reduced the run routine Section sentinel sequential search shown in Fragment simple space Space-For-Time Rule speedup statement storage stored subroutine techniques ThisDist ThisPt transformations unvisited usually vector writing efficient code
References to this book
Bibliographic information
| Title | Writing efficient programs Prentice-Hall software series |
| Author | Jon Louis Bentley |
| Publisher | Prentice-Hall, 1982 |
| Original from | the University of Michigan |
| Digitized | Jan 17, 2007 |
| ISBN | 0139702512, 9780139702518 |
| Length | 170 pages |
| Subjects | › › Computer programming Computers / General Computers / Programming / General Electronic digital computers Reference / Questions & Answers |
| Export Citation | BiBTeX EndNote RefMan |