Algorithms/Divide and Conquer: Revision history

1 February 2023

• curprev 12:2312:23, 1 February 2023‎ L10nM4st3r discuss contribs‎ 36,570 bytes −10‎ →‎Divide and Conquer Multiplication: simpler for parser (i think) and most likely faster loading in some cases. undo [automatically checked]
• curprev 12:1912:19, 1 February 2023‎ L10nM4st3r discuss contribs‎ m 36,580 bytes +16‎ →‎difficulty in initially correct binary search implementations undo [automatically checked]
• curprev 12:1712:17, 1 February 2023‎ L10nM4st3r discuss contribs‎ m 36,564 bytes +9‎ →‎difficulty in initially correct binary search implementations undo [automatically checked]
• curprev 12:1512:15, 1 February 2023‎ L10nM4st3r discuss contribs‎ m 36,555 bytes +11‎ →‎Analysis undo [automatically checked]
• curprev 12:1412:14, 1 February 2023‎ L10nM4st3r discuss contribs‎ 36,544 bytes +11‎ →‎Analysis: missed one undo [automatically checked]
• curprev 12:1312:13, 1 February 2023‎ L10nM4st3r discuss contribs‎ 36,533 bytes +16‎ →‎Analysis: feel free to revert if you disagree though undo [automatically checked]
• curprev 12:0812:08, 1 February 2023‎ L10nM4st3r discuss contribs‎ 36,517 bytes +8‎ →‎space inefficiency: looks better this way undo [automatically checked]

24 September 2022

• curprev 00:0500:05, 24 September 2022‎ 1234qwer1234qwer4 discuss contribs‎ m 36,509 bytes +1‎ intuitivey->intuitively - Fix a typo in one click undo [checked by Xania]

19 February 2022

• curprev 14:5214:52, 19 February 2022‎ 112.196.146.32 discuss‎ 36,508 bytes −2‎ →‎Iterative Version undo Tags: Mobile edit Mobile web edit

5 December 2019

• curprev 17:2817:28, 5 December 2019‎ Uziel302 discuss contribs‎ m 36,510 bytes −1‎ interative->iterative - Fix a typo in one click undo [checked by Mrjulesd]

31 July 2017

• curprev 00:5600:56, 31 July 2017‎ PokestarFan discuss contribs‎ m 36,511 bytes −6‎ clean up & typo fixing using AWB undo [automatically checked]

15 January 2015

• curprev 12:4712:47, 15 January 2015‎ 62.105.135.220 discuss‎ 36,517 bytes −1‎ No edit summary undo [checked by MarcGarver]
• curprev 12:4712:47, 15 January 2015‎ 62.105.135.220 discuss‎ 36,518 bytes +1‎ No edit summary undo

17 April 2013

• curprev 08:4308:43, 17 April 2013‎ 203.117.37.231 discuss‎ 36,517 bytes +229‎ →‎Iterative Version undo [checked by MarcGarver]
• curprev 08:2808:28, 17 April 2013‎ 203.117.37.231 discuss‎ 36,288 bytes +2‎ →‎Analysis undo
• curprev 08:2608:26, 17 April 2013‎ 203.117.37.231 discuss‎ 36,286 bytes +6‎ →‎Analysis undo
• curprev 08:2408:24, 17 April 2013‎ 203.117.37.231 discuss‎ 36,280 bytes +750‎ →‎Analysis undo

13 April 2013

• curprev 18:4418:44, 13 April 2013‎ 96.231.99.141 discuss‎ 35,530 bytes +47‎ Added test to iterative merge sort to address case where i+''unit''-1 >= n. This condition occurs when n is not a power of two and will result in array overflow if not addressed. undo [checked by Xania]

16 September 2012

• curprev 03:5003:50, 16 September 2012‎ Yhh discuss contribs‎ 35,483 bytes 0‎ →‎Divide and Conquer Multiplication: i think in multiply function instead of ''d'' := '''shift'''(''d'', ''n'') , ''a'' := '''shift'''(''a'', ''n'') is the correct one undo [checked by Xania]

3 July 2012

• curprev 15:1715:17, 3 July 2012‎ DavidCary discuss contribs‎ 35,483 bytes +1,402‎ "you will have to implement" is not exactly true; give some examples of exceptions in a footnote. undo [automatically checked]

11 November 2011

• curprev 04:1504:15, 11 November 2011‎ 128.193.8.12 discuss‎ 34,081 bytes 0‎ →‎Divide and Conquer Multiplication undo [checked by Xania]

10 September 2011

• curprev 23:3123:31, 10 September 2011‎ Filburli discuss contribs‎ 34,081 bytes −545‎ →‎Closest Pair of Points: removed my earlier misplaced post undo [checked by Jomegat]
• curprev 17:3217:32, 10 September 2011‎ Filburli discuss contribs‎ 34,626 bytes +539‎ →‎Closest Pair of Points: added Wikipedia's divide&conquer algorithm undo [checked by MarcGarver]
• curprev 16:3716:37, 10 September 2011‎ Filburli discuss contribs‎ m 34,087 bytes +2‎ →‎Iterative Version undo
• curprev 16:3716:37, 10 September 2011‎ Filburli discuss contribs‎ m 34,085 bytes +8‎ →‎Iterative Version: reorganization of a paragraph, replacement of 'chunks' with more proper 'sublists' undo

6 April 2011

• curprev 09:0909:09, 6 April 2011‎ 137.222.139.167 discuss‎ 34,077 bytes −1‎ No edit summary undo [checked by Xania]

26 February 2011

• curprev 10:4710:47, 26 February 2011‎ 202.46.23.55 discuss‎ 34,078 bytes +101‎ →‎Summary and Analysis of the 2-D Algorithm undo

25 February 2011

• curprev 12:3112:31, 25 February 2011‎ 49.137.236.94 discuss‎ 33,977 bytes −1‎ →‎Recursive Implementation undo

22 February 2011

• curprev 03:0203:02, 22 February 2011‎ Avicennasis discuss contribs‎ m 33,978 bytes −8‎ clean up, typos fixed: the the → the (2) using AWB undo

9 September 2010

• curprev 18:2318:23, 9 September 2010‎ 76.97.21.31 discuss‎ 33,986 bytes +184‎ →‎Merge Sort: added a sentance about the merge subroutine undo

17 May 2010

• curprev 13:4813:48, 17 May 2010‎ Adrignola discuss contribs‎ m 33,802 bytes −57‎ fixed template calls undo

1 April 2010

• curprev 10:2410:24, 1 April 2010‎ Kd8cpk discuss contribs‎ 33,859 bytes +22‎ Changed bases to subscripts on examples undo

15 March 2010

• curprev 04:3604:36, 15 March 2010‎ 124.181.145.138 discuss‎ 33,837 bytes +57‎ →‎difficulty in initially correct binary search implementations undo
• curprev 04:3204:32, 15 March 2010‎ 124.181.145.138 discuss‎ 33,780 bytes +4‎ →‎difficulty in initially correct binary search implementations undo
• curprev 04:3004:30, 15 March 2010‎ 124.181.145.138 discuss‎ 33,776 bytes +4‎ →‎difficulty in initially correct binary search implementations undo
• curprev 04:3004:30, 15 March 2010‎ 124.181.145.138 discuss‎ 33,772 bytes +12‎ →‎difficulty in initially correct binary search implementations undo
• curprev 04:2904:29, 15 March 2010‎ 124.181.145.138 discuss‎ 33,760 bytes +243‎ →‎difficulty in initially correct binary search implementations undo
• curprev 04:2204:22, 15 March 2010‎ 124.181.145.138 discuss‎ 33,517 bytes +133‎ →‎difficulty in initially correct binary search implementations undo
• curprev 04:1804:18, 15 March 2010‎ 124.181.145.138 discuss‎ 33,384 bytes +72‎ →‎Binary Search undo
• curprev 04:1604:16, 15 March 2010‎ 124.181.145.138 discuss‎ 33,312 bytes +766‎ →‎Binary Search undo

25 January 2010

• curprev 02:0202:02, 25 January 2010‎ Panic2k4 discuss contribs‎ 32,546 bytes −122‎ prof is missing, will check edit history undo

7 January 2009

• curprev 17:4017:40, 7 January 2009‎ HorsemansWiki discuss contribs‎ 32,668 bytes 0‎ →‎Merge Sort: function '''merge''': i and j should have 1 as initial value. undo

22 June 2008

• curprev 04:2304:23, 22 June 2008‎ 67.170.72.207 discuss‎ 32,668 bytes +11‎ →‎Binary Search undo
• curprev 04:2204:22, 22 June 2008‎ 67.170.72.207 discuss‎ 32,657 bytes +11‎ →‎Analysis undo

22 December 2007

• curprev 01:3801:38, 22 December 2007‎ Hwwong discuss contribs‎ 32,646 bytes +96‎ →‎Towers Of Hanoi Problem undo

21 December 2007

• curprev 19:4419:44, 21 December 2007‎ Hwwong discuss contribs‎ 32,550 bytes +680‎ →‎Towers Of Hanoi Problem undo
• curprev 19:0219:02, 21 December 2007‎ Hwwong discuss contribs‎ m 31,870 bytes +5‎ →‎Towers Of Hanoi Problem undo
• curprev 18:5818:58, 21 December 2007‎ Hwwong discuss contribs‎ 31,865 bytes +405‎ →‎Towers Of Hanoi Problem undo

18 October 2007

• curprev 02:2402:24, 18 October 2007‎ 68.32.74.172 discuss‎ 31,460 bytes 0‎ corrected spelling undo

15 May 2007

• curprev 12:3412:34, 15 May 2007‎ 192.117.112.92 discuss‎ 31,460 bytes +304‎ →‎Summary and Analysis of the 2-D Algorithm undo