From 9f9d47b9b2aca4ea7edb8511f1c905f7a7ee2b27 Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Mon, 2 Dec 2019 10:30:46 +0100
Subject: [PATCH] Linear probing: Fixed the previous fix

Now I understand what the original remark was intended to say :)
---
 06-hash/hash.tex | 1 +
 1 file changed, 1 insertion(+)

diff --git a/06-hash/hash.tex b/06-hash/hash.tex
index 4b2ad1f..593478f 100644
--- a/06-hash/hash.tex
+++ b/06-hash/hash.tex
@@ -779,6 +779,7 @@ By the previous lemma, one of the first 4 blocks of~$R$ is critical.
 
 Hence, the probability that run length lies between $2^{\ell+2}$ and $2^{\ell+3}$
 is bounded by the probability that one of the 12 blocks
+(chosen independently of the actual length of the run)
 is critical. By union bound and our estimate on the probability that a~block is critical,
 we get:
 
-- 
GitLab