Moved on to the next two examples in the Big O Notation Section. They covered the runtimes for a simple factorial function and a simple permutations function. I understood the reasoning behind the runtime calculations because they were very straightforward. I do however want to review a bit more to see if I am missing something.

TLDR;

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

• Still reading through the book “Cracking the Coding Interview” by Gayle Laakmann McDowell. Started working on example eleven and twelve. Example eleven covered a factorial function. I initially got the calculation wrong. I mistakenly calculated the cost for the space and thought that was for the processing time. Oh well, live and learn. The second example covered permutations. I personally haven’t worked with them for a while so I want to do some review before moving on.
• Introduced my little brother to freecodecamp.org. He loves the cat pictures in the first few challenges.

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!