ambroisie/blog
ambroisie/blog
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Compare commits

base: ambroisie:a86847417781239ce3ce98cd6560f4294cd15263
Branches Tags
ambroisie:main
..
compare: ambroisie:40dd12c50a9c0589f425361b51636cfff03fd308
Branches Tags
ambroisie:main

7 commits
a868474177 ... 40dd12c50a

Author SHA1 Message Date
Bruno BELANYI 40dd12c50a posts: gap-buffer: fix typo
All checks were successful
ci/woodpecker/push/deploy/2 Pipeline was successful
Details
2024-07-20 19:28:16 +01:00
Bruno BELANYI 8f91d00418 posts: union-find: fix typo 2024-07-20 19:28:16 +01:00
Bruno BELANYI 9f39a62771 Add Treap post 2024-07-20 19:28:16 +01:00
Bruno BELANYI 08959bacfa posts: treap: add insertion 2024-07-20 19:28:16 +01:00
Bruno BELANYI 782d4c94c6 posts: treap: add search 2024-07-20 19:28:16 +01:00
Bruno BELANYI 7eb96b11ea posts: treap: add construction 2024-07-20 19:28:16 +01:00
Bruno BELANYI dec1e79b5c posts: treap: add presentation 2024-07-20 19:28:16 +01:00
1 changed files with 3 additions and 3 deletions
Show stats Expand all files Collapse all files

6
content/posts/2024-07-20-treap/index.md
View file

@ -31,7 +31,7 @@ parent's priority is always higher than any of its children.
## What does it do? ## What does it do?
By randomizing the priority value of each key at insertion time, we ensure a By randomizing the priority value of each key at insertion time, we ensure a
high likelihood that the tree stays _roughly_ balanced, avoiding degenerating to high likelihook that the tree stays _roughly_ balanced, avoiding degenerating to
unbalanced O(N) height. unbalanced O(N) height.
Here's a sample tree created by inserting integers from 0 to 250 into the tree: Here's a sample tree created by inserting integers from 0 to 250 into the tree:
@ -41,8 +41,8 @@ Here's a sample tree created by inserting integers from 0 to 250 into the tree:
## Implementation ## Implementation
I'll be keeping the theme for this [series] by using Python to implement the I'll be keeping the theme for this [series] by using Python to implement the
_Treap_. This leads to somewhat annoying code to handle the rotation process, _Treap_. This leads to somewhat annoying code to handle the `left`/`right` nodes
which is easier to do in C using pointers. which is easier to do in C, using pointers.
[series]: {{< ref "/series/cool-algorithms/" >}} [series]: {{< ref "/series/cool-algorithms/" >}}