Algorithmintro
Jump search
Also called block search.
Jump ahead by blocks of size about sqrt(n) to find the block that could hold the key, then scan that block linearly.
Jump ahead by blocks of size about sqrt(n) to find the block that could hold the key, then scan that block linearly.
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 FX08EH Edit this page History Report an error