Algorithm Search⌘K

Algorithmcore

Hoare partition scheme

Also called Hoare partitioning.

Partition scheme scanning from both ends that swaps out-of-place pairs; fewer swaps and handles duplicates well.

Partition scheme scanning from both ends that swaps out-of-place pairs; fewer swaps and handles duplicates well.

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.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • the section The problem
  • pseudocode in The algorithm
  • complexity claims in the front matter
  • one source with a locator

Tag HR9MYC Edit this page History Report an error