Jump to content

Merge-insertion sort: 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)

30 October 2024

20 September 2024

  • curprev 09:3309:33, 20 September 2024 2a01:e0a:66:af50:6ac5:cfc5:5cbd:9321 talk 11,422 bytes +32 The third step of the algorithm (about the recursive call) now explicitly states that you have to use the merge-insertion recursively (this part was confusing and led to a lot of misimplementation around me). The Art of Computer Programming, 3rd volume by Donald Knuth explicitly states that the recursion must be made using the merge-insertion algorithm (page 184), and not a mere merge sort undo

3 April 2024

27 March 2024

26 February 2024

22 February 2024

20 February 2024

19 February 2024

1 November 2023

14 September 2023

13 August 2023

27 July 2023

22 June 2023

21 June 2023

10 November 2021

15 October 2020

31 May 2020

3 October 2019

6 August 2019

7 May 2019

6 May 2019

16 August 2018

14 August 2018

13 August 2018

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