Week 09 Notes for CS 3100 -- Fall 2000

• Take Roll.
• Check out this week's schedule
• Announcement(s)
  • Program #2 has been graded. Look for an e-mail containing your grade, comments, and information showing how points were assigned.
  • The final version of program #3 is due Wednesday.
  • We have a new directory called "Examples" in the class web space.
• Discussion of algorithm efficiency and sorting (chapter 9)
  • Do big-O analyses of selection sort, bubble sort, merge sort, and quick sort. While we are at it, discuss the sorting tasks each is best suited for.
  • Discuss ways to optimize the implementations of the sorts. Look in the Examples directory for information.

• Take Roll.
• Check out this week's schedule
• Announcement(s)
  • The final version of program #3 is due today.
• Discussion of algorithm efficiency and sorting (chapter 9) -- Documents to study are in the Examples area of the class web space.
  • Do big-O analyses of quick sort and merge sort.
  • Do some "back of the envelope" calculations to show how much time can be saved by using advanced sorts.
  • Review the reason why sorting is so important (think about searching).
  • Discuss ways to optimize the implementation of quicksort (it's worth the trouble because quick sort is generally about twice as fast as other advanced sorts.) Look in the Examples directory for information.
  • Look at a couple of examples of how to implement the partitioning for a quicksort.
  • Review "tips for sorting"

• Take Roll.
• Check out this week's schedule
• Announcement(s)