Conceptintro
Divide-and-conquer recurrence
Also called T(n) = aT(n/b) + f(n), divide-and-conquer running-time recurrence.
The standard form T(n) = a T(n/b) + f(n) for an algorithm that splits a size-n problem into a subproblems of size n/b and spends f(n) to divide and combine.
The standard form T(n) = a T(n/b) + f(n) for an algorithm that splits a size-n problem into a subproblems of size n/b and spends f(n) to divide and combine.
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 ZVHPRZ Edit this page History Report an error