Using Memoization to Speed Up Code

# What is memoization?

Yeah, that's right, memo, not memor. I asked my self this when I first saw it. Simply put, memoization can be described as the caching of the results of a sub-step within an algorithm.

That makes it perfect for recursive functions, as they waste plenty of time recomputing everything, so that's what I tried it on, a recursive function.

And what recursive function is better known than a function to calculate the Fibonacci sequence?

After learning about memoization and how to do it, I spent hours perfecting a memoization wrapper which I then used on a JavaScript bigInt Fibonacci function.

I then laughed at the speed differences.

I calculated 1000 iterations of the Fibonacci sequence in 1 second. Without it, it took forever. You can try any number less than 200,000 without choosing to loop, and you'll receive an answer within 10 seconds, guaranteed or I'll refund you.

Try it out yourself!
https://MemoizedFibonacci.studentfires.repl.run

You are viewing a single comment. View All
Highwayman (1443)

# YEAS

t

Highwayman (1443)

xxpertHacker (641)

@Highwayman
1) I'm quoting you on that.
2) Can you ping an admin/mod to move this?
3) Thanks!

xxpertHacker (641)

@Highwayman The "t" is on the next line, was that an accident?

Highwayman (1443)

@StudentFires
2) hmm ngl I have no idea who’s actually a mod on this site,
Uhhhmmm @theangryepicbanana
3) yw!

Highwayman (1443)

@StudentFires no, it was not. The t makes the YEAS into YEAST :P

xxpertHacker (641)

@Highwayman I know that, that's why I asked if it was an accident that it was on the next line, not that there was a random t.

Highwayman (1443)

@StudentFires ahh, well then in that case yea I put the t for the yeast XP

Highwayman (1443)

@StudentFires also thank you for noticing the t lol