Recursionhard
0:00.0
A tail-recursive function for computing factorial uses an accumulator: fact_tail(n, acc=1) returns acc if n==0, otherwise calls fact_tail(n-1, n*acc). How many function calls (including the initial call) are made when computing fact_tail(n)?
A tail-recursive function for computing factorial uses an accumulator: fact_tail(n, acc=1) returns acc if n==0, otherwise calls fact_tail(n-1, n*acc). How many function calls (including the initial call) are made when computing fact_tail(n)?