{2-3 sentence description of what the algorithm does and when you would use it.}
{Step-by-step explanation. Walk through a small example showing each step of the algorithm.}
Given input: {example input}
- {Step 1 description}
- {Step 2 description}
- {Step 3 description}
Result: {example output}
function algorithmName(input):
{pseudocode here}
| Case | Time | Space |
|---|---|---|
| Best | O({best}) | O({space}) |
| Average | O({avg}) | O({space}) |
| Worst | O({worst}) | O({space}) |
Why these complexities?
{Explanation of why the time complexity is what it is. What drives the best/worst case?}
- {Use case 1}
- {Use case 2}
- {Anti-pattern 1}
- {Anti-pattern 2}
| Algorithm | Time (avg) | Space | Stable | Notes |
|---|---|---|---|---|
| {This} | O({avg}) | O({s}) | {Y/N} | {note} |
| {Related} | O({avg}) | O({s}) | {Y/N} | {note} |
{Auto-generated links — do not edit manually}
- {Link to original paper, textbook reference, or authoritative source}