From 3605445bcf7f1ea5dc3e8c810bd5a387aced2078 Mon Sep 17 00:00:00 2001
From: Bruno BELANYI <bruno@belanyi.fr>
Date: Fri, 2 Aug 2024 21:04:30 +0100
Subject: [PATCH] posts: add 'reservoir-sampling'

---
 .../2024-08-02-reservoir-sampling/index.md    | 27 +++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 content/posts/2024-08-02-reservoir-sampling/index.md

diff --git a/content/posts/2024-08-02-reservoir-sampling/index.md b/content/posts/2024-08-02-reservoir-sampling/index.md
new file mode 100644
index 0000000..386a840
--- /dev/null
+++ b/content/posts/2024-08-02-reservoir-sampling/index.md
@@ -0,0 +1,27 @@
+---
+title: "Reservoir Sampling"
+date: 2024-08-02T18:30:56+01:00
+draft: false # I don't care for draft mode, git has branches for that
+description: "Elegantly sampling a stream"
+tags:
+  - algorithms
+  - python
+categories:
+  - programming
+series:
+  - Cool algorithms
+favorite: false
+disable_feed: false
+mathjax: true
+---
+
+[_Reservoir Sampling_][reservoir] is an [online][online], probabilistic
+algorithm to uniformly sample $k$ random elements out of a stream of values.
+
+It's a particularly elegant and small algorithm, only requiring $\Theta(k)$
+amount of space and a single pass through the stream.
+
+[reservoir]: https://en.wikipedia.org/wiki/Reservoir_sampling
+[online]: https://en.wikipedia.org/wiki/Online_algorithm
+
+<!--more-->