Problemcore
Merging sorted lists
Also called two-way merge, merge problem.
Combine two sorted sequences into one sorted sequence, in n+m-1 comparisons in the worst case.
Combine two sorted sequences into one sorted sequence, in n+m-1 comparisons in the worst case.
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 M8ZTQT Edit this page History Report an error