From 90a6098836b2e72c2abb2faf501dc90d76dfb6bd Mon Sep 17 00:00:00 2001 From: Julius Park Date: Mon, 1 May 2023 03:13:45 -0700 Subject: [PATCH] fix examples again 3 --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index bb0cf9b..8f43308 100644 --- a/README.md +++ b/README.md @@ -3,7 +3,7 @@ I recently read this article: https://probablydance.com/2023/04/27/beautiful-branchless-binary-search/, and I was inspired. First I implemented the same algorithm in pure Python: -https://github.com/juliusgeo/branchless_bisect/blob/67c1f89ccad442d2568441cf23a5b034912b9933/main.py#L0-L15 +https://github.com/juliusgeo/branchless_bisect/blob/67c1f89ccad442d2568441cf23a5b034912b9933/main.py#L1-L15 And then I compared it against `sortedcontainers`'s implementation of bisect_left across a large range of array sizes: