Algorithmcore
Hirschberg's algorithm
Also called Hirschberg linear-space LCS.
Recovers an LCS in O(nm) time and O(n + m) space by divide and conquer on the middle row.
Recovers an LCS in O(nm) time and O(n + m) space by divide and conquer on the middle row.
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 S3GJKS Edit this page History Report an error