CS241: Topics for the Week of October 15, 2007

• Look at labs for Lab 5: Array Based Structures and Yukon Solitaire
• Continue Lab 6: Linked Lists and Sorting Cards
• Reading: finish Chp 6 and begin Chp 7
• Discuss the Comparable Interface.
• Chap 6: Linked Structures: Look at implementation in text. Also look at java.util.LinkedList class.
• Begin discussion of sorting and complexity analysis in chapter 7.
  • Examples
    • Binary Search
    • Sorting Algorithm Demonstrations
      • comparing algorithms
      • counting comparisons and swaps
  • Time vs Memory complexity
  • Asymptotics and Asymptotic notation: big-theta (Θ), big-Oh (&Omicron), and big-Omega (Ω).
• Begin Lab 7: Complexity and Simple Sorts