Week 10

This week we looked at algorithm efficiency. This is very much like what we learned in 165 but without the proof. It's interesting to think of the huge efficiency discrepancies between algorithms. A simple loop will increase your run time by n times. Another thing I found interesting was the possibility of an average run time case. It's interesting to think of functions that have the same worst case run time but different average run time cases. This leads to specialized algorithms which are faster in different situations. I now understand why it is important to look at run times of a function.