Lines Matching refs:compute
395 the function compute the value all over again.
407 This function is very slow. Why? To compute fib(14), it first wants
408 to compute fib(13) and fib(12), and add the results. But to compute
409 fib(13), it first has to compute fib(12) and fib(11), and then it
411 is the same. And both of the times that it wants to compute fib(12),
412 it has to compute fib(11) from scratch, and then it has to do it
413 again each time it wants to compute fib(13). This function does so
415 run---fib(14) makes 1,200 extra recursive calls to itself, to compute
419 `fib' function above, it will compute fib(14) exactly once, the first
424 It doesn't compute fib(11) four times; it computes it once, getting it
541 it will not know that, and it will compute the values for these
766 # ... now compute the hash key from the arguments ...