Template:Infobox algorithm
Appearance
| Class | {{{class}}} |
|---|---|
| Data structure | {{{data}}} |
| Worst-case performance | {{{time}}} |
| Worst-case space complexity | {{{space}}} |
Usage
{{Infobox algorithm
|name = <!-- Defaults to article name -->
|class = <!-- Name of problem it solves -->
|image =
|caption =
|data =
|time = <!-- Worst time big-O notation -->
|best-time =
|average-time =
|space = <!-- Worst-case space complexity; auxiliary space
(excluding input) if not specified -->
}}
Infobox for an algorithm
| Parameter | Description | Type | Status | |
|---|---|---|---|---|
| Name | name | Name of algorithm | Content | required |
| Problem class | class | Type of problem it solves (e.g., sorting) | Content | required |
| image | image | no description | Content | optional |
| caption | caption | no description | Content | optional |
| Data structure | data | Data structure it operates on (e.g., array) | Content | optional |
| Worst-case time complexity | time | Worst-case time complexity in big O notation | Content | required |
| Best-case time complexity | best-time | no description | Content | optional |
| Average time complexity | average-time | no description | Content | optional |
| Worst-case space complexity | space | If not specified, this should be auxiliary space complexity and not include the space needed for the input | Content | required |