History of the Reading on Merge Sort

Tuesday, 24 April 2001 [Samuel A. Rebelsky]

• Created.
• The section on the costs of insertion sort was taken from http://www.cs.grinnell.edu/~stone/courses/scheme/merge-sort.xhtml.
• Some code was taken (and updated) from Examples/mergesort.ss.

Wednesday, 25 April 2001 [Samuel A. Rebelsky]

• A few minor fixes.
• This version available at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2001S/Readings/mergesort.html.

Tuesday, 26 November 2002 [Samuel A. Rebelsky]

• Reformatted slightly.
• Added sections on bottom-up merge sort and running time of merge sort.
• This version available at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2002F/Readings/mergesort.html.

Sunday, 27 April 2003 [Samuel A. Rebelsky]

• Reformatted slightly.
• This version available at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2003S/Readings/mergesort.html.

Friday, 21 November 2003 [Samuel A. Rebelsky]

• Updated some links.
• Moved history to a separate file.
• This version available at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2003F/Readings/mergesort.html.

Saturday, 11 November 2006 [Samuel A. Rebelsky]

• Added link to PDF version.
• Moved documentation for mergesort to the end of the reading.
• Other, minor, updates.

Tuesday, 14 Novembrer 2006 [Samuel A. Rebelsky]

• Reformatted table of running times.
• This version available at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2006F/Readings/mergesort.html.