Definitionintro
Sublinear time
Also called o(n) time.
Running time that is asymptotically smaller than n, so the algorithm cannot read the whole input.
Running time that is asymptotically smaller than n, so the algorithm cannot read the whole input.
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 3GZVCW Edit this page History Report an error