Algorithmcore
Treap split
Also called Split (treap).
Splits a treap by key or position into two treaps, one holding smaller elements and one holding the rest, in expected logarithmic time.
Splits a treap by key or position into two treaps, one holding smaller elements and one holding the rest, in expected logarithmic time.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag WYJ3AW Edit this page History Report an error