Talk:Divide-and-conquer algorithm - Revision history

Cewbot: Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Merge {{VA}} into {{WPBS}}. Keep majority rating "B" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WikiProject Computing}}, {{Sys rating}}.

2024-01-11T01:13:05Z

Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Merge {{VA}} into {{WPBS}}. Keep majority rating "B" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WikiProject Computing}}, {{Sys rating}}.

← Previous revision		Revision as of 01:13, 11 January 2024
Line 1:		Line 1:
	{{~~Vital~~ ~~article~~\|class=B\|~~level~~=5\|~~topic~~=~~Mathematics}}~~		{{WikiProject banner shell\|class=B\|vital=yes\|1=
	{{WikiProject ~~banner shell~~\|1=		{{WikiProject Computing\|importance=mid\|science=yes\|science-importance=high}}
	{{WikiProject ~~Computing\|class=B~~\|importance=~~mid~~\|~~science~~=~~yes\|science-importance=high~~}}		{{WikiProject Systems\|importance=high \|field=Operations research}}
	{{Sys rating \|class=B \|importance=high \|field=Operations research}}
	}}		}}

IlyaCk: /* Picture: remove intermediate levels for "10" */ new section

2023-12-09T07:37:45Z

Picture: remove intermediate levels for "10": new section

← Previous revision		Revision as of 07:37, 9 December 2023
Line 161:		Line 161:
	The recursive Towers of Hanoi algorithm which solves the problem by moving n-1 disks to the intermediate peg, the nth disk to the final page, and the n-1 disks from the intermediate peg is a great example of a recursive solution to a puzzling problem. However it is not a divide and conquer algorithm. In divide and conquer algorithms a problem of size n is typically split into m more or less equally sized subproblems (where m is usually 2, but sometimes more), then the subproblems are solved recursively, and their solutions are then combined to get a solution to the original problem. This does not take place in the Towers of Hanoi algorithm. In this algorithm, there are two recursive function calls, but their recursions are on subproblems of size n-1, and not on subproblems of size n/m. This algorithm is better classified as a "reduce by 1" algorithm, and not as a "divide and conquer" algorithm.		The recursive Towers of Hanoi algorithm which solves the problem by moving n-1 disks to the intermediate peg, the nth disk to the final page, and the n-1 disks from the intermediate peg is a great example of a recursive solution to a puzzling problem. However it is not a divide and conquer algorithm. In divide and conquer algorithms a problem of size n is typically split into m more or less equally sized subproblems (where m is usually 2, but sometimes more), then the subproblems are solved recursively, and their solutions are then combined to get a solution to the original problem. This does not take place in the Towers of Hanoi algorithm. In this algorithm, there are two recursive function calls, but their recursions are on subproblems of size n-1, and not on subproblems of size n/m. This algorithm is better classified as a "reduce by 1" algorithm, and not as a "divide and conquer" algorithm.
	[[User:Saquigley\|Saquigley]] ([[User talk:Saquigley\|talk]]) 07:32, 11 March 2018 (UTC)Sophie Quigley, Professor, Department of Computer Science, Ryerson University		[[User:Saquigley\|Saquigley]] ([[User talk:Saquigley\|talk]]) 07:32, 11 March 2018 (UTC)Sophie Quigley, Professor, Department of Computer Science, Ryerson University

			== Picture: remove intermediate levels for "10" ==

			At the picture illustrating MergeSort algorithm, I assume it would be better to skip some levels with one-element fragment "10" (only one such level should remain, not three equal ones), with repainting corresponding arrows not one level down, but either two arrows two layers down each, or maybe one arrow one layer down, one arrow three layers down.
			Reason: one-element fragment "10" IS NOT divided into parts, there are NO recursive calls for it.
			Draft visual presentation of the proposition is [https://docs.google.com/drawings/d/1vO5Zg2Q6KI8ACnFCbfs4h4lwC9_foV2PJlu5ZgX0NXc]https://docs.google.com/drawings/d/1vO5Zg2Q6KI8ACnFCbfs4h4lwC9_foV2PJlu5ZgX0NXc [[User:IlyaCk\|IlyaCk]] ([[User talk:IlyaCk\|talk]]) 07:37, 9 December 2023 (UTC)

67.198.37.16: remove wikiproject maths banner

2023-11-18T00:42:53Z

remove wikiproject maths banner

← Previous revision		Revision as of 00:42, 18 November 2023
Line 3:		Line 3:
	{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}		{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}
	{{Sys rating \|class=B \|importance=high \|field=Operations research}}		{{Sys rating \|class=B \|importance=high \|field=Operations research}}
	{{WikiProject Mathematics\|class=
	}}
	}}		}}

Smasongarrison: Category:Wikipedia vital articles in Mathematics, Added {{WikiProject Mathematics}}, replaced: {{WikiProjectBannerShell → {{WikiProject banner shell

2023-02-16T03:10:12Z

Category:Wikipedia vital articles in Mathematics, Added {{WikiProject Mathematics}}, replaced: {{WikiProjectBannerShell → {{WikiProject banner shell

← Previous revision		Revision as of 03:10, 16 February 2023
Line 1:		Line 1:
	{{Vital article\|class=B\|level=5\|topic=Mathematics}}		{{Vital article\|class=B\|level=5\|topic=Mathematics}}
			{{WikiProject banner shell\|1=
	{{WikiProjectBannerShell\|
	{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}		{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}
	{{Sys rating \|class=B \|importance=high \|field=Operations research}}		{{Sys rating \|class=B \|importance=high \|field=Operations research}}
			{{WikiProject Mathematics\|class=
			}}
	}}		}}

MalnadachBot: Fixed Lint errors. (Task 12)

2022-05-30T03:34:37Z

Fixed Lint errors. (Task 12)

← Previous revision		Revision as of 03:34, 30 May 2022
Line 143:		Line 143:
	*'''Oppose''' [[Divide and conquer algorithm class]] if necessary, but "Divide and conquer (computer science)" is rather poor as a title. -- [[Special:Contributions/70.50.151.11\|70.50.151.11]] ([[User talk:70.50.151.11\|talk]]) 06:33, 20 February 2014 (UTC)		*'''Oppose''' [[Divide and conquer algorithm class]] if necessary, but "Divide and conquer (computer science)" is rather poor as a title. -- [[Special:Contributions/70.50.151.11\|70.50.151.11]] ([[User talk:70.50.151.11\|talk]]) 06:33, 20 February 2014 (UTC)
	* {{Disagree}} '''and oppose'''. [[User:Mama meta modal\|Mama meta modal]] ([[User talk:Mama meta modal\|talk]]) 15:08, 23 February 2014 (UTC).		* {{Disagree}} '''and oppose'''. [[User:Mama meta modal\|Mama meta modal]] ([[User talk:Mama meta modal\|talk]]) 15:08, 23 February 2014 (UTC).
	*'''Counterpropose [[Divide and conquer algorithms]].''' [[WP:PLURAL]] suggests a plural title for a class of objects. (See [https://en.wikipedia.org/w/index.php?title=Wikipedia:Naming_conventions_%28plurals%29&oldid=552107628 this revision from before I started editing the guideline]; I've made some edits to it in the meantime.) Boom-shaka-laka, what's left to say? [[User:Red Slash\|<~~font~~ ~~color~~="#FF4131">Red </~~font~~>]][[User talk:Red Slash\|<b~~><font~~ ~~color~~="#460121">Slash~~</font>~~</b>]] 01:38, 25 February 2014 (UTC)		*'''Counterpropose [[Divide and conquer algorithms]].''' [[WP:PLURAL]] suggests a plural title for a class of objects. (See [https://en.wikipedia.org/w/index.php?title=Wikipedia:Naming_conventions_%28plurals%29&oldid=552107628 this revision from before I started editing the guideline]; I've made some edits to it in the meantime.) Boom-shaka-laka, what's left to say? [[User:Red Slash\|<span style="color:#FF4131;">Red </span>]][[User talk:Red Slash\|<b style="color:#460121;">Slash</b>]] 01:38, 25 February 2014 (UTC)
	:''The above discussion is preserved as an archive of a [[WP:RM\|requested move]]. <span style="color:red">'''Please do not modify it.'''</span> Subsequent comments should be made in a new section on this talk page or in a [[WP:move review\|move review]]. No further edits should be made to this section.''</div><!-- Template:RM bottom -->		:''The above discussion is preserved as an archive of a [[WP:RM\|requested move]]. <span style="color:red">'''Please do not modify it.'''</span> Subsequent comments should be made in a new section on this talk page or in a [[WP:move review\|move review]]. No further edits should be made to this section.''</div><!-- Template:RM bottom -->

WOSlinkerBot: add missing italics in discussion close to reduce lint errors

2021-09-04T14:22:48Z

add missing italics in discussion close to reduce lint errors

← Previous revision		Revision as of 14:22, 4 September 2021
Line 144:		Line 144:
	* {{Disagree}} '''and oppose'''. [[User:Mama meta modal\|Mama meta modal]] ([[User talk:Mama meta modal\|talk]]) 15:08, 23 February 2014 (UTC).		* {{Disagree}} '''and oppose'''. [[User:Mama meta modal\|Mama meta modal]] ([[User talk:Mama meta modal\|talk]]) 15:08, 23 February 2014 (UTC).
	*'''Counterpropose [[Divide and conquer algorithms]].''' [[WP:PLURAL]] suggests a plural title for a class of objects. (See [https://en.wikipedia.org/w/index.php?title=Wikipedia:Naming_conventions_%28plurals%29&oldid=552107628 this revision from before I started editing the guideline]; I've made some edits to it in the meantime.) Boom-shaka-laka, what's left to say? [[User:Red Slash\|<font color="#FF4131">Red </font>]][[User talk:Red Slash\|<b><font color="#460121">Slash</font></b>]] 01:38, 25 February 2014 (UTC)		*'''Counterpropose [[Divide and conquer algorithms]].''' [[WP:PLURAL]] suggests a plural title for a class of objects. (See [https://en.wikipedia.org/w/index.php?title=Wikipedia:Naming_conventions_%28plurals%29&oldid=552107628 this revision from before I started editing the guideline]; I've made some edits to it in the meantime.) Boom-shaka-laka, what's left to say? [[User:Red Slash\|<font color="#FF4131">Red </font>]][[User talk:Red Slash\|<b><font color="#460121">Slash</font></b>]] 01:38, 25 February 2014 (UTC)
	:''The above discussion is preserved as an archive of a [[WP:RM\|requested move]]. <span style="color:red">'''Please do not modify it.'''</span> Subsequent comments should be made in a new section on this talk page or in a [[WP:move review\|move review]]. No further edits should be made to this section.</div><!-- Template:RM bottom -->		:''The above discussion is preserved as an archive of a [[WP:RM\|requested move]]. <span style="color:red">'''Please do not modify it.'''</span> Subsequent comments should be made in a new section on this talk page or in a [[WP:move review\|move review]]. No further edits should be made to this section.''</div><!-- Template:RM bottom -->

	== Outline ==		== Outline ==

RenatUK: Fixed {{Vital article}}; WP:TALKORDER

2021-08-04T02:05:06Z

Fixed {{Vital article}}; WP:TALKORDER

← Previous revision		Revision as of 02:05, 4 August 2021
Line 1:		Line 1:
			{{Vital article\|class=B\|level=5\|topic=Mathematics}}
	{{WikiProjectBannerShell\|		{{WikiProjectBannerShell\|
	{{Vital article\|class=B\|level=5\|link=Wikipedia:Vital articles/Level/5/Mathematics\|anchor=Algorithms (25 articles)}}
	{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}		{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}
	{{Sys rating \|class=B \|importance=high \|field=Operations research}}		{{Sys rating \|class=B \|importance=high \|field=Operations research}}

Cewbot: Maintain {{Vital article}}: The article is listed in the level 5 page: Algorithms (25 articles)

2021-01-30T08:11:31Z

Maintain {{Vital article}}: The article is listed in the level 5 page: Algorithms (25 articles)

← Previous revision		Revision as of 08:11, 30 January 2021
Line 1:		Line 1:
	{{WikiProjectBannerShell\|		{{WikiProjectBannerShell\|
			{{Vital article\|class=B\|level=5\|link=Wikipedia:Vital articles/Level/5/Mathematics\|anchor=Algorithms (25 articles)}}
	{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}		{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}
	{{Sys rating \|class=B \|importance=high \|field=Operations research}}		{{Sys rating \|class=B \|importance=high \|field=Operations research}}

2607:FEA8:1D20:981:9577:349F:7FF8:6A22: /* Karatsuba is the author of the first fast method */

2019-03-05T22:22:37Z

Karatsuba is the author of the first fast method

← Previous revision		Revision as of 22:22, 5 March 2019
Line 30:		Line 30:
	== Karatsuba is the author of the first fast method ==		== Karatsuba is the author of the first fast method ==

	In the theory of fast computation "~~diide~~		In the theory of fast computation "divide
	and conquer" is the name of the first fast method which was found by		and conquer" is the name of the first fast method which was found by
	Anatolii A. Karatsuba in 1960. The published papers of Gauss (including		Anatolii A. Karatsuba in 1960. The published papers of Gauss (including

SshibumXZ: SshibumXZ moved page Talk:Divide and conquer algorithm to Talk:Divide-and-conquer algorithm without leaving a redirect: Requested at WP:RM/T by Mikhail Ryazanov; reasoning was: "MOS:HYPHEN".

2018-12-09T23:36:33Z

SshibumXZ moved page Talk:Divide and conquer algorithm to Talk:Divide-and-conquer algorithm without leaving a redirect: Requested at WP:RM/T by Mikhail Ryazanov; reasoning was: "MOS:HYPHEN".

← Previous revision	Revision as of 23:36, 9 December 2018
(No difference)

← Previous revision		Revision as of 01:13, 11 January 2024
Line 1:		Line 1:
	{{~~Vital~~ ~~article~~\|class=B\|~~level~~=5\|~~topic~~=~~Mathematics}}~~		{{WikiProject banner shell\|class=B\|vital=yes\|1=
	{{WikiProject ~~banner shell~~\|1=		{{WikiProject Computing\|importance=mid\|science=yes\|science-importance=high}}
	{{WikiProject ~~Computing\|class=B~~\|importance=~~mid~~\|~~science~~=~~yes\|science-importance=high~~}}		{{WikiProject Systems\|importance=high \|field=Operations research}}
	{{Sys rating \|class=B \|importance=high \|field=Operations research}}
	}}		}}

← Previous revision		Revision as of 03:10, 16 February 2023
Line 1:		Line 1:
	{{Vital article\|class=B\|level=5\|topic=Mathematics}}		{{Vital article\|class=B\|level=5\|topic=Mathematics}}
			{{WikiProject banner shell\|1=
	{{WikiProjectBannerShell\|
	{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}		{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}
	{{Sys rating \|class=B \|importance=high \|field=Operations research}}		{{Sys rating \|class=B \|importance=high \|field=Operations research}}
			{{WikiProject Mathematics\|class=
			}}
	}}		}}

← Previous revision		Revision as of 03:34, 30 May 2022
Line 143:		Line 143:
	*'''Oppose''' [[Divide and conquer algorithm class]] if necessary, but "Divide and conquer (computer science)" is rather poor as a title. -- [[Special:Contributions/70.50.151.11\|70.50.151.11]] ([[User talk:70.50.151.11\|talk]]) 06:33, 20 February 2014 (UTC)		*'''Oppose''' [[Divide and conquer algorithm class]] if necessary, but "Divide and conquer (computer science)" is rather poor as a title. -- [[Special:Contributions/70.50.151.11\|70.50.151.11]] ([[User talk:70.50.151.11\|talk]]) 06:33, 20 February 2014 (UTC)
	* {{Disagree}} '''and oppose'''. [[User:Mama meta modal\|Mama meta modal]] ([[User talk:Mama meta modal\|talk]]) 15:08, 23 February 2014 (UTC).		* {{Disagree}} '''and oppose'''. [[User:Mama meta modal\|Mama meta modal]] ([[User talk:Mama meta modal\|talk]]) 15:08, 23 February 2014 (UTC).
	*'''Counterpropose [[Divide and conquer algorithms]].''' [[WP:PLURAL]] suggests a plural title for a class of objects. (See [https://en.wikipedia.org/w/index.php?title=Wikipedia:Naming_conventions_%28plurals%29&oldid=552107628 this revision from before I started editing the guideline]; I've made some edits to it in the meantime.) Boom-shaka-laka, what's left to say? [[User:Red Slash\|<~~font~~ ~~color~~="#FF4131">Red </~~font~~>]][[User talk:Red Slash\|<b~~><font~~ ~~color~~="#460121">Slash~~</font>~~</b>]] 01:38, 25 February 2014 (UTC)		*'''Counterpropose [[Divide and conquer algorithms]].''' [[WP:PLURAL]] suggests a plural title for a class of objects. (See [https://en.wikipedia.org/w/index.php?title=Wikipedia:Naming_conventions_%28plurals%29&oldid=552107628 this revision from before I started editing the guideline]; I've made some edits to it in the meantime.) Boom-shaka-laka, what's left to say? [[User:Red Slash\|<span style="color:#FF4131;">Red </span>]][[User talk:Red Slash\|<b style="color:#460121;">Slash</b>]] 01:38, 25 February 2014 (UTC)
	:''The above discussion is preserved as an archive of a [[WP:RM\|requested move]]. <span style="color:red">'''Please do not modify it.'''</span> Subsequent comments should be made in a new section on this talk page or in a [[WP:move review\|move review]]. No further edits should be made to this section.''</div><!-- Template:RM bottom -->		:''The above discussion is preserved as an archive of a [[WP:RM\|requested move]]. <span style="color:red">'''Please do not modify it.'''</span> Subsequent comments should be made in a new section on this talk page or in a [[WP:move review\|move review]]. No further edits should be made to this section.''</div><!-- Template:RM bottom -->

← Previous revision		Revision as of 02:05, 4 August 2021
Line 1:		Line 1:
			{{Vital article\|class=B\|level=5\|topic=Mathematics}}
	{{WikiProjectBannerShell\|		{{WikiProjectBannerShell\|
	{{Vital article\|class=B\|level=5\|link=Wikipedia:Vital articles/Level/5/Mathematics\|anchor=Algorithms (25 articles)}}
	{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}		{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}
	{{Sys rating \|class=B \|importance=high \|field=Operations research}}		{{Sys rating \|class=B \|importance=high \|field=Operations research}}

← Previous revision		Revision as of 08:11, 30 January 2021
Line 1:		Line 1:
	{{WikiProjectBannerShell\|		{{WikiProjectBannerShell\|
			{{Vital article\|class=B\|level=5\|link=Wikipedia:Vital articles/Level/5/Mathematics\|anchor=Algorithms (25 articles)}}
	{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}		{{WikiProject Computing\|class=B\|importance=mid\|science=yes\|science-importance=high}}
	{{Sys rating \|class=B \|importance=high \|field=Operations research}}		{{Sys rating \|class=B \|importance=high \|field=Operations research}}