Day 10: mat385

Today:

• Note: our first test will cover material through 2.5.

• Return Homework 2.2
  • #11
  • #28

• Hand in homework 2.4.

• Section 2.5: Analysis of Algorithms

• Problems from section 2.5 homework:
  • Suggestions?

• Section 3.1:

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."
• 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)