Algorithmcore
Lomuto partition scheme
Also called Lomuto partitioning.
Partition scheme that scans once and places the pivot at its final index; simple but does more swaps.
Partition scheme that scans once and places the pivot at its final index; simple but does more swaps.
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 N086ME Edit this page History Report an error