Theoremcore
Mergesort optimality
Shows that mergesort uses a number of comparisons that matches the lower bound for comparison sorting, up to lower order terms.
Shows that mergesort uses a number of comparisons that matches the lower bound for comparison sorting, up to lower order terms.
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 VNK43J Edit this page History Report an error