Content deleted Content added
←Created page with '== Usage == <pre> {{Infobox algorithm |name = <!-- Defaults to article name --> |class = <!-- Name of problem it solves --> |image =...' |
syntaxhighlight lang="wikitext" |
||
(5 intermediate revisions by 3 users not shown) | |||
Line 1:
{{Documentation subpage}}
<!-- Please place categories where indicated at the bottom of this page and interwikis at Wikidata (see [[Wikipedia:Wikidata]]) -->
{{Lua|Module:Infobox|Module:InfoboxImage|Module:Check for unknown parameters}}
== Example ==
Quicksort Algorithm
{{Infobox algorithm
|name = Quicksort Algorithm
| class = [[Sorting algorithm]]
| image = Sorting quicksort anim.gif
| caption = Animated visualization of the quicksort algorithm. The horizontal lines are pivot values.
| data =
| time = O(''n''<sup>2</sup>) <!-- If it wasn't rare, the average time would be closer to it. -->
| average-time = O(''n'' log ''n'')
| best-time = O(''n'' log ''n'') (simple partition)<br />or O(''n'') (three-way partition and equal keys)
| space = O(''n'') auxiliary (naive)<br />O(log ''n'') auxiliary (Hoare 1962)<!-- see his paper and discussion of the 'nest' use -->
| optimal = No <!-- optimal is defined as worst case -->
| stability = [[Sorting algorithm#Classification|Not Stable]]
}}
== Usage ==
<syntaxhighlight lang="wikitext">
{{Infobox algorithm
|name = <!-- Defaults to article name -->
Line 13 ⟶ 32:
(excluding input) if not specified -->
}}
</syntaxhighlight>
<includeonly>{{Sandbox other||
<!-- CATEGORIES AND INTERWIKIS HERE, THANKS -->
[[Category:Computer science infobox templates|Algorithm]]
}}</includeonly>
<templatedata>
{
|