List of Figures

Part I: Programming

Figure 1.1: An if-else structure. First, the condition at the top is checked. If it holds, then the commands on the right are executed. If not, then the commands on the left are executed, including another if-else question.
Figure 1.2: A loop: the same instruction is repeated for i = 0, 1, 2, 3, 4, 5, 6 (SIMD).
Figure 1.3: Nested loops: the outer loop goes over i = 0, 1, 2; for each particular i, the inner loop goes over j = 0, 1, 2.
Figure 1.4: Pascal s triangle.
Figure 1.5: An iteration of the bisection algorithm for choosing a subinterval in which the local maximum of f lies. f is calculated at three intermediate points. If the maximum at these points is obtained at the midpoint, then the middle subinterval is chosen (a). If it is obtained at the left point, then the left subinterval is chosen (b). If it is obtained at the right point, then the right subinterval is chosen (c).
Figure 1.6: An iteration of the golden-ratio algorithm for choosing a subinterval in which the local maximum of f lies. f is calculated at the intermediate points l and r. If f(l) > f(r), then the left subinterval is chosen (a); otherwise, the right one is chosen (b).
Figure 1.7: The "fix()" function calculates 3 7 + 12/3 by scanning it backward until the + is...

< Previous Excerpt Next Excerpt >

Purchase This Book