Skip to content

Commit

Permalink
fix examples again 3
Browse files Browse the repository at this point in the history
  • Loading branch information
juliusgeo committed May 1, 2023
1 parent d2196d0 commit 90a6098
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -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:

Expand Down

0 comments on commit 90a6098

Please sign in to comment.