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 01:0601:06, 2 March 2019 201.210.88.27 talk 4,035 bytes −27 →Details of the algorithm: Line 13 of the recursive algorithm must be deleted. undo

curprev 02:4002:40, 3 February 2019 Meters talk contribs 4,062 bytes +5 Undid revision 881509775 by 76.21.40.49 (talk) good faith, but let's just leave it as a permutation. No need to change to generic "input" undo Tag: Undo
curprev 01:4301:43, 3 February 2019 76.21.40.49 talk 4,057 bytes −5 →Details of the algorithm undo

curprev 18:5018:50, 24 January 2019 Glrx talk contribs 4,062 bytes +27 Undid revision 879783455 by Sashka76 (talk) discussed on talk many times undo Tag: Undo

curprev 04:4404:44, 21 December 2018 2620:0:1000:2811:460c:72a1:1700:9487 talk 4,011 bytes −27 Removed extra generate(...) call in the recursive implementation. Removed generate() is obviously a bug since it would cause 2*n! output() calls rather than the correct n!. To reason about it, generate will now call generate n times, which will then each call generate n-1 times resulting in n*n-1*n-2*n-3*... which is n!. undo Tag: Visual edit

curprev 19:4819:48, 26 November 2018 Glrx talk contribs 4,038 bytes −586 revert to 15 July. Do not change langs. undo

curprev 20:3620:36, 29 October 2018 Diannaa talk contribs 4,624 bytes −1,361 remove copyright content copied from http://codegist.net/code/heap%27s-algorithm-pseudocode Tag: Undo

curprev 05:0305:03, 28 October 2018 24.7.51.67 talk 5,985 bytes +1,361 Add Java alternative

curprev 12:5412:54, 12 October 2018 159.220.58.1 talk 4,624 bytes −92 No edit summary undo
curprev 12:3212:32, 12 October 2018 159.220.58.1 talk 4,716 bytes +1,212 Reinserted Algorithm detailed explination. undo

curprev 12:5812:58, 2 October 2018 94.25.181.116 talk 2,615 bytes −1,421 No edit summary undo
curprev 11:4511:45, 2 October 2018 94.25.181.117 talk 4,036 bytes +943 ... undo Tag: Undo
curprev 11:0111:01, 2 October 2018 94.25.181.118 talk 3,093 bytes −943 heap's algorithm is the one where first two elements swapped on every odd iteration. sedgewick's algorithm have different order and shouldnt be equated with heap's. (unfortunately, confusion already spreaded to everywhere). undo

curprev 13:2213:22, 29 September 2018 नीरज अधिकारी talk contribs m 4,036 bytes −2 Fix indentation level inside the first 'if' block undo
curprev 13:1813:18, 29 September 2018 नीरज अधिकारी talk contribs 4,038 bytes +27 The recursive implementation of the algorithm was incorrect. It generated only (n-1)! permutations. undo

curprev 20:3920:39, 15 July 2018 Glrx talk contribs 4,038 bytes +27 Undid revision 850380666 by 2601:19B:800:CA90:2C9E:F3F4:4100:6559 (talk) see talk page undo Tag: Undo
curprev 14:0114:01, 15 July 2018 2601:19b:800:ca90:2c9e:f3f4:4100:6559 talk 4,011 bytes −27 I test the algorithm in Python. The extra line after the for loop will double-output some arrangements. After it is deleted, the result is correct. That extra line is not described in the explanation, I have know idea why it is there. undo