On Fri, Oct 30, 2015 at 9:05 AM, Roelof Wobben wrote:
Now I have to think about how to read the values of f 1 .. fn 2 . I
think I need 2 recursive function . One for g x and one for reading
f1 or use a list to store f 0 .. f n and then use maximum.
There are different ways to solve the problem, certainly. I think this problem is asking you to do the recursion yourself rather than use existing recursive functions such as 'maximum' from the Prelude. I would assume you are allowed to define other functions to help you as needed.