brozek/website
1
0
Fork 0
mirror of https://github.com/Brandon-Rozek/website.git synced 2025-10-10 06:51:13 +00:00
Code Issues Projects Releases Packages Activity

Syndicated to Medium

Browse source
This commit is contained in:
Brandon Rozek 2023-01-25 13:20:29 -05:00
parent 17e7209a41
commit bfa4e52c0b
No known key found for this signature in database
GPG key ID: 26E457DA82C9F480
15 changed files with 95 additions and 75 deletions
Download patch file Download diff file Expand all files Collapse all files

13
content/blog/memoization-scala.md
View file

@ -1,10 +1,12 @@
---
title: "Memoization in Scala"
date: 2022-11-12T11:49:51-05:00
date: 2022-11-12 11:49:51-05:00
draft: false
tags: ["Scala"]
math: false
medium_enabled: true
medium_post_id: 2558d6abd9b8
tags:
- Scala
title: Memoization in Scala
---
In a [recent post](/blog/corecursion-unfold-infinite-sequences/), I talked about how corecursion is a great solution for removing redundant calculations. However if we're sticking to a recursive approach, one way we can reduce redundancies is to use memoization. The idea here is that we save prior computations in some data structure and refer to them if requested.
@ -34,7 +36,4 @@ Calling `fib(5)` returns `5`. However, we can also see the saved computations by
```
HashMap(0 -> 0, 1 -> 1, 2 -> 1, 3 -> 2, 4 -> 3, 5 -> 5)
```
```