Week 08 Notes for CS 3100 -- Fall 2000

• Take Roll.
• Check out this week's schedule
• Announcement(s)
  • Sorry, no progress yet on grading program #2.
  • I put assignment #4 into the web space
  • Watch out about the due dates!! Start all tasks as early as possible. Don't expect it will be "OK" to start work on program #4 after program #3 is due, or to start work on program #5 after program #4 is due.
• Discuss lower level details of the programming assignment.
• Discussion of algorithm efficiency and sorting (chapter 9)
  • Re-cap the big-O findings of the comparison between insertion sort and radix sort.
  • 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.

• Take Roll.
• Check out this week's schedule
• Announcement(s)
  • Sorry, no progress yet on grading program #2.
  • I did some "repairs" on the ListT.h and ListT.cpp files. They seem OK now, but let me know if you have any problems. The latest time-stamp is: (Latest Revision: Wed Oct 25 00:06:27 PDT 2000)
• Take questions on the programming assignment
• Discussion of algorithm efficiency and sorting (chapter 9)
  • Re-cap the big-O findings of the comparison between insertion sort and radix sort.
  • 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.

• Take Roll.
• Check out this week's schedule
• Announcement(s)
  • Sorry, no progress yet on grading program #2. Expect progress this weekend.
  • I did more still more "repairs" on ListT.h and ListT.cpp files. I gave the list class operator= overloading. (Latest Revision: Thu Oct 26)
• 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.