Algorithmresearch
Funnelsort
Also called cache-oblivious merge sort, cache-oblivious sort, lazy funnelsort.
A cache-oblivious sort that merges with a recursive k-merger, achieving the optimal block transfer bound without knowing M or B.
A cache-oblivious sort that merges with a recursive k-merger, achieving the optimal block transfer bound without knowing M or B.
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 VCKGXK Edit this page History Report an error