Problemintro
Counting inversions
Also called inversion counting, inversion number.
Given a sequence, count its inversions in O(n log n) time.
Given a sequence, count its inversions in O(n log n) time.
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 D599TE Edit this page History Report an error