Test my Merit My Results Create Exam

Combinatorics | Generating Functions

The running time of an algorithm is given by T(n) = T(n-1) + T(n-2) - T(n-3), if n > 3  = n, otherwise Then what should be the relation between T(1), T(2) and T(3), so that the order of the algorithm is constant ?
A girl has to make pizza with different toppings. There are 8 different toppings. In how many ways can she make pizzas with 2 different toppings?
Ads