21 pages matching binary search in this book
Results 1-3 of 21
What people are saying - Write a review
We haven't found any reviews in the usual places.
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 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 pointer 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