Class 47: Merge Sort

Held Thursday, April 26, 2001

Summary

Today we explore a divide-and-conquer sorting technique, merge sort.

Notes

• Although I am loathe (sp?) to say it in a week in which I'm being observed, it looks like I won't get the exams graded for tomorrow. I will get them back on Monday.
• The sample code for a Web service is now ready.
  • You can find it at http://www.cs.grinnell.edu/~rebelsky/Web/Scheme/plans.ss.
  • You can test it at http://www.cs.grinnell.edu/~rebelsky/Web/Scheme/plans.cgi.
  • Warning! The service does not do well with simultaneous users.
  • Warning! The update page doesn't load past information correctly.
  • We'll talk about it in class tomorrow.
• I've been hearing a lot of interesting discussion about possible GIMP aplications, so I'm assuming most of you will do that.
  • I've also heard of at least one group that's developed a Web service already.
• Wandering around the lab yesterday, I noticed that most of you are writing your six Ps. I just wanted to compliment you on it.

Overview

• Lab
• Reflection

Lab

• Do the lab.
• Pause to reflect.