Theoremadvanced
Expected run length of replacement selection
Also called snowplow run length theorem.
On random input, replacement selection produces runs of expected length about twice the heap capacity.
On random input, replacement selection produces runs of expected length about twice the heap capacity.
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 1YP931 Edit this page History Report an error