Timeline for Heap's Algorithm for k-permutations?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 8 at 22:54 | comment | added | burnall | Small correction: "nmk-3" => N - K - 3 | |
| Aug 12, 2023 at 4:39 | history | edited | Pseudonym♦ | CC BY-SA 4.0 |
deleted 1 character in body
|
| Aug 12, 2023 at 2:26 | history | edited | Pseudonym♦ | CC BY-SA 4.0 |
added 701 characters in body
|
| Aug 12, 2023 at 2:11 | comment | added | Pseudonym♦ | Yes, sorry, this is a bug. | |
| Aug 11, 2023 at 22:17 | comment | added | Ana | The above solution does not seem to work. P(N=8, K=4) = 1680 and the solution returns 1680 values, but only 515 unique values. They should all be unique. It seems to only return incorrect values with even K. Would you be able to provide working code? | |
| Aug 11, 2023 at 17:21 | vote | accept | Ana | ||
| Aug 11, 2023 at 22:11 | |||||
| Aug 11, 2023 at 8:34 | comment | added | Ana | Thanks Pseudonym. Why does the single swap eliminate the duplicates? | |
| Aug 11, 2023 at 8:02 | history | answered | Pseudonym♦ | CC BY-SA 4.0 |