Day 10: mat385

Today:

• Note: our first test (next week, Wednesday 2/22) will cover only material through 2.5.

• Return Homework 2.2: #22, 61

• Hand in homework 2.4.

• Section 2.5: Analysis of Algorithms

• Problems from section 2.5 homework:
  • Suggestions?

• Section 3.1: Sets

Links:

• "Note: any time you have a procedure whose complexity is less than O(n), it means intuitively that the procedure does not examine all of the input." Binary sort beats O(n) by having already examined the input, and having put it in order.
• A nice description of complexity with applications to sorting
• A great Venn diagram applet
• A nice Venn diagram applet (for the basic ideas). (From this source)