Question
3b The Fibonacci k-step numbers are a generalization of the Fibonacci and Tetranacci sequences, where F i = 0 for i 0, F1 = 1,
3b
The Fibonacci k-step numbers are a generalization of the Fibonacci and Tetranacci sequences, where Fi = 0 for i 0, F1 = 1, F2 = 1, and for every j 3:
Fj = Fj-1 + Fj-2 + + Fj-k,
i.e. Fj is the sum of the k previous numbers in the sequence. You will implement an OCaml function fib_k_step : int -> int -> int for computing these numbers efficiently.
(b)TODO: Implement an OCaml function fib_k_step : int -> int -> int, which accepts two integers n and k and, for a fixed k, computes in time linear in n the nth Fibonacci k-step number.
starter code:
let fib_k_step (k : int) (n : int) : int = (* your work here *) 0
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started