Algorithmintro
Interval containment by sorting
Also called Sort by start ascending and end descending.
Sort by start and end, then compare each interval with its successors.
Sort by start and end, then compare each interval with its successors.
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 8YB754 Edit this page History Report an error