fi(xi, xi−1, . . . , x1), for i = 1, . . . , n, where fi’s are from a fixed set Ops. – Most importantly, only xi is explicitly passed to the i-th function. The algorithm must store x1, . . . , xi−1 (or some functions thereof) in memory so it can access them when computing fi. – The idea is to arrange the values in some clever way (the data structure) in order to make computing the fi (and updat...