Algorithmadvanced
Kung's algorithm
Also called Kung-Luccio-Preparata algorithm, maxima-finding divide and conquer.
Divide-and-conquer computation of the maxima of a vector set, running in O(n log n) for d up to 3 and O(n log^(d-2) n) for higher d.
Divide-and-conquer computation of the maxima of a vector set, running in O(n log n) for d up to 3 and O(n log^(d-2) n) for higher d.
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 R32A7X Edit this page History Report an error