Week 10: big-Oh

The efficiency of an algorithm you write is obviously something important to consider, especially when it comes to dealing with large quantities amounts of data. It is therefore important to be able to assess what the efficiency will be. In class we learned how to do this.

 By considering the input size as "n",  and the efficiency would be how many steps the algorithm must go through with respect to n. If a function takes 2 steps for each item in the input, then it would be 2n. It can get much much more complex than this though. Computer scientists primarily focus on the big-Oh which is the part that affects the efficiency the most.

I feel as though its impossible to stay up to date with this class as well as all my other courses. With the lectures, lab, assignments, exercises, this SLOG and term tests, I always have some compsci to do but I can never feel like I can sit down and really take a while to take in a concept. Hopefully some time will come my way sooner than later.