Problemadvanced
External permuting
Also called permuting in external memory, external permutation.
Rearrange N records into a given permutation on disk; its I/O cost is min of N and the sorting bound.
Rearrange N records into a given permutation on disk; its I/O cost is min of N and the sorting bound.
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 0NBC1N Edit this page History Report an error