---
title: "Discussion on \"F# tips weekly #15: Recursive memoize\" | Hashnode"
description: "Discussion on \"F# tips weekly #15: Recursive memoize\". Memoization of a recursive function can be often useful, but has some pitfalls compared to memoization of a simple function. Let's take a detailed look.\nStandard Memoization\nLet's use the classical example of computing the n-th item in the Fibonacci ..."
url: "https://hashnode.com/posts/f-tips-weekly-15-recursive-memoize/663c8f4f1cc138a20d798383"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [F# tips weekly #15: Recursive memoize](https://jindraivanek.hashnode.dev/f-tips-weekly-15-recursive-memoize?utm_source=hashnode&utm_medium=feed)

Memoization of a recursive function can be often useful, but has some pitfalls compared to memoization of a simple function. Let's take a detailed look. Standard Memoization Let's use the classical example of computing the n-th item in the Fibonacci ...

May 9, 2024 · 3 min read · jindraivanek.hashnode.dev  
Read the article

-   [#fsharp](https://hashnode.com/tag/fsharp)
-   [#f](https://hashnode.com/tag/f)
-   [#tips](https://hashnode.com/tag/tips)
-   [#memoization](https://hashnode.com/tag/memoization)

## Written by

[Jindřich Ivánek](https://hashnode.com/@jindraivanek)

@jindraivanek · Prague, Czech Republic

  
[View profile](https://hashnode.com/@jindraivanek)

F# developer

Software developer focused mainly on F#, with a passion for functional programming, problem solving, efficient algorithms and programming languages. I have a strong computer science background, focused mainly in graph theory and graph algorithms; also was intrigued by data structures, complexity, and computability theory. Experienced with backend F# programming. I worked with mathematical optimization (mixed integer programming) and use of statistical methods as well. I contributed to several open source F# projects, mostly around developer tooling.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
