Question

I'm having trouble understanding lecture 8 on complexities and algorithms. What are the main ideas I should be getting out of it.

Answer 1

Have not warched it in a while, but here are some generalities.

In short, the more complex an operation is, the less you want to do it. So you want to do simpler things if possible. However, sometimes a large progression of simple things is more time consuming than one, more complex thing. Also, some things that are quicker take a lot of memory, so if you do not have the memory it is not worth it. When you pick an algorithm to use you will look at these things. Then you will pick the solution that is best for what resources you have. That is what things like complexity analisis are about.