April 01, 2006
An Algorithm for Compressing Space and Time
(a)
int fib(int n) {
if (n < 3)
return 1 ;
return fib(n-1) + fib(n-2) ;
}
(b)
int cache[] ;
int fib(int n) {
if (n < 3)
return 1 ;
if (cache[n])
return cache[n] ;
return cache[n] = fib(n-1) + fib(n-2) ;
}
Example 1: Recursive formulation.
Previous Page |
1
|
2
|
3
|
4
|
5
|
6
|
7
Next Page
|
 |
|
|||||||||||||||||||||||||||
|
|
|
