Jump to content

Change-making problem: 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)

13 September 2025

  • curprev 11:2911:29, 13 September 2025 Jimtla talk contribs 7,949 bytes −1,967 Delete the "Dynamic programming with the probabilistic convolution tree" section. This is unsourced (the citation given does not refer to the changemaking problem) and incorrect, as noted by the talk page discussion 7(!) years ago. undo Tag: section blanking

16 June 2025

10 February 2025

3 November 2024

18 September 2024

20 May 2024

30 March 2024

1 March 2024

20 November 2023

9 November 2023

9 October 2022

8 July 2022

14 March 2022

20 February 2022

  • curprev 17:2417:24, 20 February 2022 Jsundram talk contribs m 9,390 bytes −86 made the code slightly more readable (`coins[c-1]` becomes `coin` by using python's `enumerate` function. Tested on one example to make sure code still runs and produces the same result. undo

24 August 2021

24 April 2021

12 April 2021

8 March 2021

2 March 2021

21 September 2020

17 April 2020

16 April 2020

4 March 2020

13 December 2019

30 November 2019

20 November 2019

6 November 2019

15 September 2019

19 June 2019

15 May 2019

30 April 2019

  • curprev 05:1905:19, 30 April 2019 David Eppstein talk contribs 11,118 bytes +499 Undo. The assumption of a coin of value 1 is stated clearly in the first paragraph of the article. And "far more efficient" and "just store a set instead of a number in each cell rather than backtracking" do not go together. undo
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)