Heap's algorithm: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 22:0122:01, 22 April 2018 Glrx talk contribs 4,038 bytes +31 Undid revision 837488961 by 219.77.50.163 (talk) see talk undo Tag: Undo

curprev 04:3904:39, 21 April 2018 219.77.50.163 talk 4,007 bytes −31 →Details of the algorithm undo

curprev 00:2000:20, 11 April 2018 Glrx talk contribs 4,038 bytes +27 Undid revision 835789007 by SeanCheey (talk) see talk undo Tag: Undo

curprev 19:4319:43, 10 April 2018 SeanCheey talk contribs 4,011 bytes −27 →Details of the algorithm: remove the redundant generate function to eliminate extra outputs that will generates wrong answer undo

curprev 23:3523:35, 3 April 2018 Glrx talk contribs 4,038 bytes −21 revert last 3; keep the code simple undo

curprev 20:0320:03, 8 March 2018 158.97.91.179 talk 4,059 bytes −3 →Details of the algorithm undo
curprev 20:0120:01, 8 March 2018 158.97.91.179 talk 4,062 bytes −1 →Details of the algorithm undo

curprev 19:4419:44, 12 February 2018 92.210.50.176 talk 4,063 bytes +25 →Details of the algorithm undo

curprev 21:5321:53, 20 December 2017 Glrx talk contribs 4,038 bytes +3 Undid revision 814569444 by 27.5.213.106 (talk) undo

curprev 16:3316:33, 9 December 2017 27.5.213.106 talk 4,035 bytes −3 →Details of the algorithm undo

curprev 10:3210:32, 27 November 2017 216.171.51.22 talk 4,038 bytes 0 if size is odd, swap first and last element; If size is even, swap ith and last element; The original version is correct undo
curprev 09:3609:36, 27 November 2017 MattiasFredsberg talk contribs m 4,038 bytes 0 Swaps were in the wrong order for recursive solution. (I have verified it in code.) Its fine in the procedural solution. Probably caused by quick translation of psude-code with one as index base. undo

curprev 20:5120:51, 20 September 2017 109.63.174.16 talk 4,038 bytes 0 No edit summary undo
curprev 20:0020:00, 20 September 2017 109.63.174.16 talk 4,038 bytes 0 No edit summary undo

curprev 21:3021:30, 7 September 2017 Glrx talk contribs 4,038 bytes −132 Undid revision 798921606 by WhackTheWiki (talk) OR undo

curprev 16:0116:01, 4 September 2017 WhackTheWiki talk contribs m 4,170 bytes +132 →Details of the algorithm: Point out that the recursive version may perform better (as happens w/ gcc 4.8.5 -O4) undo

curprev 16:0316:03, 25 August 2017 Glrx talk contribs 4,038 bytes −129 Revert to 18 June; see talk pages for prior discussion undo
curprev 15:2415:24, 25 August 2017 WhackTheWiki talk contribs m 4,167 bytes +24 →Details of the algorithm undo
curprev 15:1515:15, 25 August 2017 WhackTheWiki talk contribs m 4,143 bytes −4 →Details of the algorithm undo
curprev 04:1404:14, 25 August 2017 WhackTheWiki talk contribs 4,147 bytes +140 →Details of the algorithm: Point out the (confusing) change to origin 0, and that the algorithm is does too many swaps, so it's not really Heap's algorithm. undo

curprev 07:2707:27, 2 August 2017 Trlkly talk contribs 4,007 bytes 0 →Details of the algorithm: A[0] swaps on even,in my tests and according to http://jsdepth.com/hello-world/ undo
curprev 06:3506:35, 2 August 2017 Trlkly talk contribs 4,007 bytes −27 →Details of the algorithm: extra call to function is incorrect undo
curprev 06:0606:06, 2 August 2017 Trlkly talk contribs 4,034 bytes −4 →Details of the algorithm: testing shows needs to run until n, not n-1 undo

curprev 15:0415:04, 18 June 2017 Glrx talk contribs 4,038 bytes +31 Undid revision 786249914 by 2604:2000:800A:AAF0:E1C9:4133:2577:A180 (talk) extra swap. see talk page undo
curprev 06:5706:57, 18 June 2017 2604:2000:800a:aaf0:e1c9:4133:2577:a180 talk 4,007 bytes −31 →Details of the algorithm: this line "for i := 0; i < n - 1; i += 1 do" was incorrect. Should be i < n, not i < n -1. There was also an extra "generate(n - 1, A)" after the for loop. undo

curprev 03:0703:07, 8 June 2017 Glrx talk contribs 4,038 bytes +27 Undid revision 784292516 by Mujina93 (talk) please read talk page undo

curprev 14:0914:09, 7 June 2017 Mujina93 talk contribs m 4,011 bytes −27 There was an additional call to generate(n-1,A) after the for loop, which shouldn't be there. Compare with http://www.geeksforgeeks.org/heaps-algorithm-for-generating-permutations/ undo

curprev 15:3715:37, 13 May 2017 94.114.24.22 talk 4,038 bytes 0 →Details of the algorithm undo
curprev 15:3515:35, 13 May 2017 94.114.24.22 talk 4,038 bytes 0 No edit summary undo

curprev 22:3922:39, 8 April 2017 Knorky2k1 talk contribs m 4,038 bytes +1 No edit summary undo
curprev 21:3721:37, 8 April 2017 Knorky2k1 talk contribs m 4,037 bytes −1 →Details of the algorithm undo

curprev 19:0519:05, 24 February 2017 Glrx talk contribs 4,038 bytes +4 Undid revision 765663044 by 209.12.169.218 (talk) see talk page undo

curprev 18:2918:29, 15 February 2017 209.12.169.218 talk 4,034 bytes −4 →Details of the algorithm undo

curprev 12:1912:19, 1 January 2017 Watchduck talk contribs 4,038 bytes +309 add {{oeis|A280318}}, use math template for formulas, use lowercase ''n'' undo

curprev 02:2502:25, 26 December 2016 Glrx talk contribs 3,729 bytes −2,245 revert last 4; repeated text and code undo

curprev 17:1417:14, 21 December 2016 195.188.200.6 talk 5,974 bytes −50 No edit summary undo
curprev 17:1217:12, 21 December 2016 195.188.200.6 talk 6,024 bytes +3 No edit summary undo
curprev 17:1117:11, 21 December 2016 195.188.200.6 talk 6,021 bytes +2,277 →See also undo Tag: nowiki added
curprev 17:1017:10, 21 December 2016 195.188.200.6 talk 3,744 bytes +15 →Details of the algorithm undo

curprev 11:5211:52, 13 December 2016 71.172.164.191 talk 3,729 bytes −7 Undid revision 754578070 by 71.172.164.191 (talk) undo
curprev 11:5111:51, 13 December 2016 71.172.164.191 talk 3,736 bytes +7 Direction of iteration ("add one") didn't match what was established earlier in the paragraph ("i to 0") undo

curprev 09:4909:49, 17 November 2016 37.205.63.157 talk 3,729 bytes 0 →Details of the algorithm undo
curprev 09:4609:46, 17 November 2016 37.205.63.157 talk 3,729 bytes 0 →Details of the algorithm undo

curprev 19:0719:07, 6 November 2016 Glrx talk contribs 3,729 bytes +27 Undid revision 748163049 by 41.148.41.228 (talk) read talk undo
curprev 18:3718:37, 6 November 2016 41.148.41.228 talk 3,702 bytes −27 corrected the Heap recursive algorithm by removing the 2nd recursive call just after the end of the for Loop (line 12) undo

curprev 21:4921:49, 29 October 2016 Glrx talk contribs 3,729 bytes +12 →Details of the algorithm: restate no increment for loop undo
curprev 21:4721:47, 29 October 2016 Glrx talk contribs 3,717 bytes −72 Revert to Aug 6; no reason to kill for loop in top version undo

curprev 11:0211:02, 15 October 2016 81.181.70.246 talk 3,789 bytes +2 →Details of the algorithm undo

curprev 17:3417:34, 13 October 2016 RolandIllig talk contribs 3,787 bytes −17 →Details of the algorithm: Convert the for loop to a while loop, since there is no increment undo

curprev 09:4209:42, 24 September 2016 45.112.69.183 talk 3,804 bytes +94 No edit summary undo

Heap's algorithm: Revision history

22 April 2018

21 April 2018

11 April 2018

10 April 2018

3 April 2018

8 March 2018

12 February 2018

20 December 2017

9 December 2017

27 November 2017

20 September 2017

7 September 2017

4 September 2017

25 August 2017

2 August 2017

18 June 2017

8 June 2017

7 June 2017

13 May 2017

8 April 2017

24 February 2017

15 February 2017

1 January 2017

26 December 2016

21 December 2016

13 December 2016

17 November 2016

6 November 2016

29 October 2016

15 October 2016

13 October 2016

24 September 2016