Template:Algorithm - Revision history

GrishinaAnna at 08:57, 15 October 2016

2016-10-15T08:57:09Z

← Older revision		Revision as of 08:57, 15 October 2016
Line 29:		Line 29:
	}}		}}
	</source>		</source>

			[[en:Template:Algorithm]]
			</noinclude>

GrishinaAnna at 08:28, 15 October 2016

2016-10-15T08:28:20Z

← Older revision		Revision as of 08:28, 15 October 2016
Line 29:		Line 29:
	}}		}}
	</source>		</source>

	~~[[en:Template:Algorithm]]~~
	~~</noinclude>~~

GrishinaAnna at 08:25, 15 October 2016

2016-10-15T08:25:56Z

← Older revision	Revision as of 08:25, 15 October 2016
Line 1:	Line 1:
		<includeonly>
		{{level-a}}
		{{infobox
		\| style-options=max-width: 40%
		\| title={{{name\|}}}
		\| title-1={{#if: {{{serial_complexity\|}}}{{{input_data\|}}}{{{output_data\|}}} \| Последовательный алгоритм}}
		\| label-1.1=Последовательная сложность
		\| data-1.1={{{serial_complexity\|}}}
		\| label-1.2=Объём входных данных
		\| data-1.2={{{input_data\|}}}
		\| label-1.3=Объём выходных данных
		\| data-1.3={{{output_data\|}}}
		\| title-2={{#if: {{{parallel_complexity\|}}}{{{pf_height\|}}}{{{pf_width\|}}} \| Параллельный алгоритм}}
		\| label-2.1=Параллельная сложность
		\| data-2.1={{{parallel_complexity\|}}}
		\| label-2.2=Высота ярусно-параллельной формы
		\| data-2.2={{{pf_height\|}}}
		\| label-2.3=Ширина ярусно-параллельной формы
		\| data-2.3={{{pf_width\|}}}
		}}</includeonly><noinclude>
		<source lang=html4strict>
		{{algorithm
		\| name = Разложение Холецкого
		\| serial_complexity = <math>O(n^3)</math>
		\| pf_height = <math>O(n)</math>
		\| pf_width = <math>O(n^2)</math>
		\| input_data = <math>\frac{n (n + 1)}{2}</math>
		\| output_data = <math>\frac{n (n + 1)}{2}</math>
		}}
		</source>

		[[en:Template:Algorithm]]
		</noinclude>

GrishinaAnna: Blanked the page

2016-10-15T08:19:55Z

Blanked the page

← Older revision		Revision as of 08:19, 15 October 2016
Line 1:		Line 1:
	~~{{algorithm~~
	~~\| name = Метод Якоби вычисления сингулярных чисел и векторов~~
	~~\| serial_complexity = <math>O(n^3)</math>~~
	~~\| pf_height = <math></math>~~
	~~\| pf_width = <math></math>~~
	~~\| input_data = <math>n^2</math>~~
	~~\| output_data = <math>2n^2 + n</math>~~
	}}

GrishinaAnna at 08:12, 15 October 2016

2016-10-15T08:12:14Z

← Older revision		Revision as of 08:12, 15 October 2016
Line 1:		Line 1:
	{{algorithm		{{algorithm
	\| name = ~~Разложение Холецкого~~		\| name = Метод Якоби вычисления сингулярных чисел и векторов
	\| serial_complexity = <math>O(n^3)</math>		\| serial_complexity = <math>O(n^3)</math>
	\| pf_height = <math>~~O(n)~~</math>		\| pf_height = <math></math>
	\| pf_width = <math>~~O(n^2)~~</math>		\| pf_width = <math></math>
	\| input_data = <math>~~\frac{~~n ~~(n + 1)}{~~2}</math>		\| input_data = <math>n^2</math>
	\| output_data = <math>~~\frac{n (~~n ~~+ 1)}{2}~~</math>		\| output_data = <math>2n^2 + n</math>
	}}		}}

GrishinaAnna: Created page with "{{algorithm | name = Разложение Холецкого | serial_complexity = $O(n^3)$ | pf_height = $O(n)$ | pf_width..."

2016-10-15T08:03:44Z

Created page with "{{algorithm | name = Разложение Холецкого | serial_complexity = <math>O(n^3)</math> | pf_height = <math>O(n)</math> | pf_width..."

New page

{{algorithm
| name = Разложение Холецкого
| serial_complexity = <math>O(n^3)</math>
| pf_height = <math>O(n)</math>
| pf_width = <math>O(n^2)</math>
| input_data = <math>\frac{n (n + 1)}{2}</math>
| output_data = <math>\frac{n (n + 1)}{2}</math>
}}