Down the rabbit hole I went once again. This time it’s to get a better of how Sets, Sequences, and Series work in math. These terms have been used multiple times in the Big O notation examples and until now I have brushed them off believing that I understood them. However, with the most recent example algorithm utilizing the Fibonacci sequence and the Geometric sequence I needed to know exactly what was going on.

TLDR;

Okay, so here are the highlights of what I did:

• Still reading through the book “Cracking the Coding Interview” by Gayle Laakmann McDowell. I got stuck on example fourteen and jumped down the rabbit hole to better understand the explanation. The book highlighted the similarities between the Fibonacci sequence and a Geometric sequence as n becomes larger. Since I am not entirely familiar with the term sequence I went digging. I ended up looking into the definition and properties of not just sequences, but sets, and series as well. Once again it feels like I am learning more about math than I am about coding specifically but I imagine that this is what it’s all about. The code is an expression of the math that is working behind the scenes.

Conclusion

That’s all for today. If you are interested in the MIT course you can check out the video lecture I’m currently going through. The lecture is helpful but isn’t sufficient by itself. Anyways, until next time PEACE!