Divide-and-conquer algorithm: Revision history

11 August 2005

• curprev 11:3511:35, 11 August 2005 Adam78 talk contribs 6,928 bytes +47 →See also: + Divide and rule undo

8 August 2005

• curprev 07:0407:04, 8 August 2005 YurikBot talk contribs m 6,881 bytes −82 robot Adding: it, nl Removing: es undo

5 August 2005

• curprev 00:1200:12, 5 August 2005 Dcoetzee talk contribs 6,963 bytes +26 →Memory access: Link cache-oblivious model undo

4 August 2005

• curprev 23:4023:40, 4 August 2005 Dcoetzee talk contribs m 6,937 bytes 0 Divide and conquer (computer science) moved to Divide and conquer algorithm undo

3 August 2005

• curprev 08:3308:33, 3 August 2005 Taichi talk contribs m 6,937 bytes +11 No edit summary undo
• curprev 08:2608:26, 3 August 2005 Taichi talk contribs m 6,926 bytes +26 +:es undo

12 June 2005

• curprev 20:5520:55, 12 June 2005 XJaM talk contribs m 6,900 bytes +1 Typo undo
• curprev 20:5520:55, 12 June 2005 XJaM talk contribs m 6,899 bytes +47 sl:deli in vladaj (računalništvo undo

6 May 2005

• curprev 03:1203:12, 6 May 2005 217.88.80.70 talk 6,852 bytes +129 + he undo

22 April 2005

• curprev 20:1920:19, 22 April 2005 Stevenj talk contribs 6,723 bytes +10 No edit summary undo
• curprev 10:2810:28, 22 April 2005 Fredrik talk contribs m 6,713 bytes 0 oops undo
• curprev 10:2610:26, 22 April 2005 Fredrik talk contribs m 6,713 bytes +4 No edit summary undo

24 March 2005

• curprev 06:1506:15, 24 March 2005 LiDaobing talk contribs m 6,709 bytes +32 +zh undo

4 March 2005

• curprev 21:5321:53, 4 March 2005 Stevenj talk contribs m 6,677 bytes +1 Reverted edits by 128.118.253.21 to last version by MIT Trekkie undo
• curprev 05:1705:17, 4 March 2005 128.118.253.21 talk 6,676 bytes −1 →Parallelism undo

29 January 2005

• curprev 21:1721:17, 29 January 2005 MIT Trekkie talk contribs m 6,677 bytes +24 →References: +cat undo

8 December 2004

• curprev 13:2513:25, 8 December 2004 Finem talk contribs 6,653 bytes +199 Combining sub-problems is often difficult. undo

5 December 2004

• curprev 23:3523:35, 5 December 2004 Stevenj talk contribs m 6,454 bytes −2 Reverted edits by 80.3.64.7 to last version by Neg undo
• curprev 20:4320:43, 5 December 2004 80.3.64.7 talk 6,456 bytes +2 →Parallelism undo

21 September 2004

• curprev 12:5612:56, 21 September 2004 Neg talk contribs 6,454 bytes +26 +de: undo

3 June 2004

• curprev 22:2122:21, 3 June 2004 Stevenj talk contribs m 6,428 bytes +1 →Disadvantages undo
• curprev 22:2122:21, 3 June 2004 Stevenj talk contribs 6,427 bytes +11 →Memory access undo
• curprev 22:1822:18, 3 June 2004 Stevenj talk contribs 6,416 bytes +116 No edit summary undo
• curprev 21:4121:41, 3 June 2004 Jorge Stolfi talk contribs 6,300 bytes +90 oops - reverted, will try again later undo
• curprev 21:3221:32, 3 June 2004 Jorge Stolfi talk contribs 6,210 bytes −90 DEL "sorting is n^2"(heapsort is not D&C but is N log N. Probably ditto for FFT) undo
• curprev 17:5617:56, 3 June 2004 Stevenj talk contribs 6,300 bytes −357 →Implementation: divide & conquer, by defintion, employs two or more subproblems (all recursive algorithms are not divide and conquer) undo
• curprev 17:5417:54, 3 June 2004 Stevenj talk contribs 6,657 bytes +258 →Algorithm efficiency: some additional restrictions for O(n log n) undo
• curprev 17:4817:48, 3 June 2004 Stevenj talk contribs 6,399 bytes +28 →Parallelism: phrasing, note that this especially true on SMP; divide and conquer produces 2+ subproblems by definition (otherwise, it's not "dividing" the problem) undo
• curprev 17:4317:43, 3 June 2004 Stevenj talk contribs 6,371 bytes +431 →Memory access: corrected discussion of cache obliviousness -- optimality is *not* automatic; the recursion has to be properly designed for FFTs, matrix multiplies, etcetera undo
• curprev 17:3017:30, 3 June 2004 Stevenj talk contribs 5,940 bytes +133 →Reference: added summation reference undo
• curprev 17:2517:25, 3 June 2004 Stevenj talk contribs 5,807 bytes +1,343 →Disadvantages undo
• curprev 07:5307:53, 3 June 2004 138.38.32.84 talk 4,464 bytes +1 →Disadvantages undo

31 May 2004

• curprev 07:2107:21, 31 May 2004 Jorge Stolfi talk contribs m 4,463 bytes +17 fixed links to recursive procedure and call stack undo
• curprev 07:0507:05, 31 May 2004 Jorge Stolfi talk contribs m 4,446 bytes +58 Fixed links to cache and NUMA undo
• curprev 07:0007:00, 31 May 2004 Jorge Stolfi talk contribs 4,388 bytes 0 →References: external links undo
• curprev 06:5906:59, 31 May 2004 Jorge Stolfi talk contribs 4,388 bytes +347 + some disadvantages undo
• curprev 06:4906:49, 31 May 2004 Jorge Stolfi talk contribs 4,041 bytes +143 →Memory access: Reworded to better fit the level of the article undo
• curprev 06:2506:25, 31 May 2004 Jorge Stolfi talk contribs 3,898 bytes +142 →Parallelism: fleshing out undo
• curprev 03:2103:21, 31 May 2004 Jorge Stolfi talk contribs 3,756 bytes +1,253 Started rewording/reformatting undo

27 May 2004

• curprev 06:1506:15, 27 May 2004 Phe talk contribs m 2,503 bytes +17 fix interwiki fr: undo

15 April 2004

• curprev 02:1402:14, 15 April 2004 Jorge Stolfi talk contribs 2,486 bytes +52 some rewording undo

7 April 2004

• curprev 13:2313:23, 7 April 2004 Head talk contribs m 2,434 bytes −25 -de: undo

20 February 2004

• curprev 21:3921:39, 20 February 2004 213.157.5.169 talk 2,459 bytes +50 de undo

13 November 2003

• curprev 10:3710:37, 13 November 2003 Daniel Quinlan talk contribs m 2,409 bytes −1 No edit summary undo

27 October 2003

• curprev 07:1107:11, 27 October 2003 Stevenj talk contribs m 2,410 bytes +4 bold definitions undo

13 July 2003

• curprev 21:3421:34, 13 July 2003 Looxix~enwiki talk contribs m 2,406 bytes +29 interlanguage links undo

21 May 2003

• curprev 08:4408:44, 21 May 2003 Poor Yorick talk contribs m 2,377 bytes +30 No edit summary undo

10 April 2003

• curprev 04:3804:38, 10 April 2003 Stevenj talk contribs 2,347 bytes +14 clarification undo

25 March 2003

• curprev 12:0412:04, 25 March 2003 62.253.64.7 talk 2,333 bytes −10 ² -> ² undo
• curprev 03:5403:54, 25 March 2003 TakuyaMurata talk contribs 2,343 bytes +2,343 make a new article