Problem 44381. Cache me Outside

Created by @bmtran (Bryant Tran)

Solve Later

The test suite includes a simple recursive Fibonacci sequence generator, but it's terribly inefficient. One simple method for improving its performance is using a technique called memoization. Write a function that takes a function_handle that we wish to memoize and returns a function_handle to a memoized version of the initial handle.

Solve

Solution Stats

Last solution submitted on Sep 01, 2019

Last 200 Solutions

Problem Comments

5 Comments

5 Comments

Show 2 older comments

@bmtran (Bryant Tran) on 17 Oct 2017

Whoops, accidentally had the answer in the test suite. Fixed now.

Paul Dostert on 20 Oct 2017

Bryant,

Any chance you can elaborate a bit? I can make a memoized fibonacci code, but that's not really what you're asking. I don't get what the function call with 2 arguments (and 2nd argument the function itself) is in the test set: seq = memfib(n-1, memfib);

Sorry for the confusion.

James on 2 Nov 2017

Paul, it uses a feature that was just introduced in R2017a. If the answer hadn't accidentally been in the test suite, I never would have figured this one out either!

Andrew Newell on 7 Dec 2017

I tried comparing this code with a non-memoized version, and it was 6 times slower!

Hans Kramer on 25 Apr 2018

Love the name of the problem.^^

Problem 44381. Cache me Outside

Solution Stats

Last 200 Solutions

Problem Comments

Recent Solvers70

Suggested Problems

More from this Author57

Tags

Problem 44381. Cache me Outside

Solution Stats

Last 200 Solutions

Problem Comments

Recent Solvers70

Suggested Problems

More from this Author57

Tags

Players