agenda

• review
• insertion sort
• analyzing algorithms
• big-o notation
• reading

insertion sort

analyzing algorithms

• what is the function associated with that algorithm?
• how many computational steps does it take to complete?
• now we need to compare to other functions

big-o notation

• we only look at the dominant term
• T(n) = 25n^3+log(n)+2^2 = 0(2^n)
• T(n) = 3n2+100n = 0(n^2)