The usual recursive formulation of fibonacci function let rec fib n = if n 0 then...

 

Transcribed Image Text:

The usual recursive formulation of fibonacci function let rec fib n = if n 0 then 0 else if n 1 then 1 else fib (n-1) + fib (n-2) has exponential running time. It will take a long time to compute fib 50. But we know that fibonacci number can be computed in linear time by remembering just the current cur and the previous prev fibonacci number. In this case, the next fibonacci number is computed as the sum of the current and the previous numbers. Implement a tail recursive function fib_tailrec that uses this idea and computes the nth fibonacci number in linear time. fib_tailrec int -> int let fib_tailrec n = (* YOUR CODE HERE *) assert (fib_tailrec 50 = 12586269025); assert (fib_tailrec 90= 2880067194370816120) The usual recursive formulation of fibonacci function let rec fib n = if n 0 then 0 else if n 1 then 1 else fib (n-1) + fib (n-2) has exponential running time. It will take a long time to compute fib 50. But we know that fibonacci number can be computed in linear time by remembering just the current cur and the previous prev fibonacci number. In this case, the next fibonacci number is computed as the sum of the current and the previous numbers. Implement a tail recursive function fib_tailrec that uses this idea and computes the nth fibonacci number in linear time. fib_tailrec int -> int let fib_tailrec n = (* YOUR CODE HERE *) assert (fib_tailrec 50 = 12586269025); assert (fib_tailrec 90= 2880067194370816120)

Answer rating: 100% (QA)

Solution taking integer n as input let fabtailrec n ... View the full answer