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 04:4404:44, 8 October 2024 2a01:799:913:bb00:4efa:7411:67f6:d94a talk 13,343 bytes +2 // minor edit undo
curprev 04:4304:43, 8 October 2024 2a01:799:913:bb00:4efa:7411:67f6:d94a talk 13,341 bytes +4 // minor error in a comment undo Tag: Visual edit

curprev 02:2502:25, 1 January 2024 OAbot talk contribs m 13,337 bytes +20 Open access bot: doi updated in citation with #oabot. undo

curprev 10:3510:35, 31 October 2023 Kubanczyk talk contribs 13,317 bytes +23 →Proof undo

curprev 18:3118:31, 17 May 2023 2601:602:9800:7890:90:5912:6648:b2b0 talk 13,294 bytes +23 fix reference to talk "Permutation Generation Algorithms" undo

curprev 23:3523:35, 23 April 2023 Citation bot talk contribs 13,271 bytes +18 Add: date. | Use this bot. Report bugs. | Suggested by Anderjef | #UCB_toolbar undo
curprev 23:3523:35, 23 April 2023 Pmw2piVB talk contribs 13,253 bytes −16 Changing short description from "An algorithm that generates all possible permutations of n objects" to "Method of generating all permutations of n objects" undo Tag: Shortdesc helper

curprev 17:5117:51, 6 June 2022 Pennbrook talk contribs m 13,269 bytes 0 Simplify iterative implementation undo

curprev 22:1722:17, 11 February 2022 Qwerfjkl (bot) talk contribs m 13,269 bytes 0 Capitalising short description "an algorithm that generates all possible permutations of n objects" per WP:SDFORMAT (via Bandersnatch) undo

curprev 23:3523:35, 13 January 2022 Jarble talk contribs 13,269 bytes +89 adding a short description undo

curprev 05:5705:57, 13 December 2021 24.133.244.36 talk 13,180 bytes +3 →Details of the algorithm: Fix equality sign as per convention in mathematics undo

curprev 04:2904:29, 15 November 2021 Citation bot talk contribs 13,177 bytes +19 Add: s2cid. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_toolbar undo

curprev 12:1212:12, 29 October 2021 Martinfreedman talk contribs 13,158 bytes 0 There was a coding error in the Pascal for this iterative solution. i needs to be (re)initialised to 0 not 1 otherwise not all permutations are generated. undo Tag: Visual edit

curprev 19:0319:03, 7 May 2021 GreenC bot talk contribs 13,158 bytes −62 Removed oxfordjournals.com URL per discussion. Wayback Medic 2.5 undo

curprev 20:5420:54, 6 May 2021 OAbot talk contribs m 13,220 bytes +16 Open access bot: doi added to citation with #oabot. undo

curprev 19:2319:23, 12 April 2021 2a02:810d:32c0:544:fcb5:1d10:3e2:d14c talk 13,204 bytes +2 No edit summary undo
curprev 18:3718:37, 12 April 2021 2a02:810d:32c0:544:fcb5:1d10:3e2:d14c talk 13,202 bytes −2 No edit summary undo
curprev 18:3318:33, 12 April 2021 2a02:810d:32c0:544:fcb5:1d10:3e2:d14c talk 13,204 bytes −1 No edit summary undo

curprev 06:1806:18, 10 March 2021 94.252.121.186 talk 13,205 bytes 0 case i=0 does nothing => removed undo Tags: Mobile edit Mobile app edit iOS app edit

curprev 05:5105:51, 19 February 2021 97.126.19.185 talk 13,205 bytes 0 fix iterative case to not call the else branch unnecessarily (for n=4 cuts down calls into the non-swap else branch to 18 from 41) the 1977 paper sets this to i=2 with 1-indexed arrays, so we set it here to i=1 with 0-indexed arrays (the powerpoint PDF appears to be incorrect) undo

curprev 18:3018:30, 26 January 2021 92.9.167.73 talk 13,205 bytes 0 It seems the if statement should be the other way around upon testing the recursive solution. I have not tested the other solutions so I will leave them as is, but they potentially need a swap of the if statements as well. undo

curprev 11:2211:22, 4 January 2021 RESaTErC talk contribs 13,205 bytes 0 Fix example pseudo-code (for odd indexes, A[0] has to be swapped instead of A[i] to yield valid permutations) undo

curprev 22:5622:56, 21 December 2020 Ira Leviton talk contribs m 13,205 bytes +1 Fixed a typo found with Wikipedia:Typo Team/moss. undo

curprev 18:4618:46, 12 December 2020 Monkbot talk contribs m 13,204 bytes −18 Task 18 (cosmetic): eval 3 templates: del empty params (2×); undo Tag: AWB

curprev 08:3308:33, 14 October 2020 Oflocet talk contribs m 13,222 bytes +2 Fix typo in non-recursive format comment. undo Tag: Visual edit

curprev 20:4420:44, 10 July 2020 WOSlinker talk contribs m 13,220 bytes +90 change source to syntaxhighlight undo

curprev 08:2108:21, 24 March 2020 DocWatson42 talk contribs 13,130 bytes 0 →Frequent mis-implementations: Corrected an instance of capitalization. undo Tags: Mobile edit Mobile web edit Advanced mobile edit

curprev 21:5121:51, 13 March 2020 AnomieBOT talk contribs m 13,130 bytes +16 Dating maintenance tags: {{Clarify}} undo
curprev 19:5019:50, 13 March 2020 192.222.130.66 talk 13,114 bytes +11 →Proof undo

curprev 01:4501:45, 27 February 2020 140.77.130.217 talk 13,103 bytes 0 Switch cases of the algorithm to make the algorithm correct (wrong result with length(A)=3 and didn't matched the proof) undo

curprev 23:0923:09, 26 February 2020 SyntaxZombie talk contribs m 13,103 bytes 0 in recursive algorithm, when k is even, A[0] and A[k-1] should swap, and when k is odd, A[i] and A[k-1] should swap. Otherwise, when K == 0, the algorithm swaps the first and last element twice and never swaps the second and last element. undo

curprev 23:2323:23, 2 February 2020 Reyk talk contribs 13,103 bytes −22 reduce verbosity per Wikipedia:Manual_of_Style/Words_to_watch#Editorializing and MOS:NOTE undo

curprev 15:0615:06, 9 January 2020 70.167.37.1 talk 13,125 bytes +2 Undid revision 934953504 by 70.167.37.1 (talk) I hink I missed the initial call to generate() undo Tag: Undo
curprev 14:4814:48, 9 January 2020 70.167.37.1 talk 13,123 bytes −2 Fixed bug in recursive implementation; loop should either go to (i < k) or (i <= (k - 1)) undo

curprev 07:2707:27, 7 December 2019 2a02:908:956:fe00:72e7:9b0a:23b2:7b2a talk 13,125 bytes +14 →Details of the algorithm undo

curprev 12:0212:02, 25 November 2019 Frap talk contribs 13,111 bytes −2 No edit summary undo

curprev 21:2921:29, 26 September 2019 109.166.133.226 talk 13,113 bytes +4 lnk undo

curprev 21:0121:01, 1 August 2019 Wiki.phylo talk contribs m 13,109 bytes +1 hold -> holds undo

curprev 13:5313:53, 29 May 2019 Torsten Mütze talk contribs 13,108 bytes +216 Added wheel diagram of the output of Heap's algorithm. undo

curprev 10:0510:05, 13 April 2019 31.20.157.141 talk 12,892 bytes −2 fixed indentation undo

curprev 20:0020:00, 12 April 2019 Nat965 talk contribs m 12,894 bytes −7 Apply Gen fix(es), typo(s) fixed: For example → For example,, revert back → revert undo Tag: AWB

curprev 07:0207:02, 5 April 2019 Cedar101 talk contribs m 12,901 bytes −160 →Proof: <pre>, {{mvar}} undo

curprev 00:4200:42, 10 March 2019 Rwstandridge talk contribs m 13,061 bytes −14 →Details of the algorithm undo

curprev 21:2021:20, 9 March 2019 107.131.186.37 talk 13,075 bytes +26 Fixed Typesetting undo

6 January 2025

8 October 2024

1 January 2024

31 October 2023

17 May 2023

23 April 2023

6 June 2022

11 February 2022

13 January 2022

13 December 2021

15 November 2021

29 October 2021

7 May 2021

6 May 2021

12 April 2021

10 March 2021

19 February 2021

26 January 2021

4 January 2021

21 December 2020

12 December 2020

14 October 2020

10 July 2020

24 March 2020

13 March 2020

27 February 2020

26 February 2020

2 February 2020

9 January 2020

7 December 2019

25 November 2019

26 September 2019

1 August 2019

29 May 2019

13 April 2019

12 April 2019

5 April 2019

10 March 2019

9 March 2019