CSSE 230: Session Notes - Day 7

Topics

• Removal of elements using the iterators
• Analysis of Algorithms:
  • Bounds
  • Big-Oh, Big-Omega, Big-Theta, Little-Oh
  • Practice of analysis

Outline

• [5 min] Contact before work
• [15 min] EZ Analysis: Review of Runtimes HW
• [15 min] Introduction to Big-Oh. Demo of counting everything in linear search.
• [5 min] Introduction to Big-Omega, Big-Theta, Little-Oh
• [5 min] Introduction to Bounds
• [5 min] Break
• [20 min] Practice of analysis of algorithms. Analysing best, worst and average case of binary search.
• [5 min] Break
• [10 min] Writing good code: Turning Weiss's version of "remove" into a true OO version.
• [15 min] Removing elements from a tree using the iterator.
• [5 min] Discussion of exceptions of remove in iterators and how to detect them.
• [15 min] Remove in the pre-order iterator
• [Balance of time] Work on the programming assignment

Materials

• Binary search analysis worksheet

Homework

• Day 9, BC: Big-Oh analysis homework Please submit a pdf copy of your work and please place your name near the top of your document. Submissions that do not satisfy these two constraints will not be graded. Thank you.