From 7e3e31f58bcc61aac61704a5be154762fe081067 Mon Sep 17 00:00:00 2001
From: Brandon Rozek <rozekbrandon@gmail.com>
Date: Wed, 9 Nov 2022 18:00:58 -0500
Subject: [PATCH] Added acknowledgement

---
 content/blog/different-views-of-fold.md | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/content/blog/different-views-of-fold.md b/content/blog/different-views-of-fold.md
index 0bb4232..c03cd5e 100644
--- a/content/blog/different-views-of-fold.md
+++ b/content/blog/different-views-of-fold.md
@@ -68,7 +68,7 @@ When building out complex functions we may want to loop multiple times:
 
 ### $n_1 + n_2$ Complexity
 
-The following is an example of this class of algorithms.
+The following is an example[^1] of this class of algorithms.
 
 Given a list of words, title case each word and combine them into a single sentence.
 
@@ -146,3 +146,7 @@ l1.foldLeft(id_outer)((c1, n1) =>
     )
 )
 ```
+
+
+
+[^1]: Thanks Clare for thinking of this example!