Jump to content

Pancake sorting: Revision history


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

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

18 July 2024

16 July 2024

15 June 2024

  • curprev 16:2116:21, 15 June 20242003:fa:7f19:2300:138b:892e:350e:25dd talk 21,228 bytes 0 In OEIS A092113 with n = 13 and k = 7 the Number is 7046318 and NOT 7046321. The numbers in the n-the row added together needs to be equal to n!. This was not the case before, so there had to be a mistake. I wrote a program to generate this integer sequence and found out that the 7th number was wrong. undo

10 June 2024

21 May 2024

22 March 2024

10 December 2023

6 November 2023

23 August 2023

14 July 2023

15 May 2023

  • curprev 21:5121:51, 15 May 2023194.28.233.112 talk 21,876 bytes +68 The python code sample does not check whether the specific bit of the array is already sorted, this code adds nearly 1.5x unnecessary flips (eg. an array of 3 elements should take 3 flips, not 4). These two if-checks makes sure that the array is not already sorted before flipping, by checking if the index of the biggest number (maxdex) isn't in the last position (n - 1) where it should be and if maxdex isn't 0 in which case there is no need to do flip#1. undo

22 January 2023

28 December 2022

19 December 2022

16 November 2022

28 June 2022

20 February 2022

18 November 2021

17 November 2021

2 August 2021

13 July 2021

10 July 2021

6 July 2021

17 May 2021

3 May 2021

6 April 2021

8 March 2021

3 March 2021

5 January 2021

28 December 2020

25 December 2020

7 July 2020

17 May 2020

9 May 2020

29 April 2020

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)