I'm having trouble understanding lecture 8 on complexities and algorithms. What are the main ideas I should be getting out of it.
MIT 6.00 Intro Computer Science (OCW)
Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
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.