Continuing through another example Big O Runtime calculation and I have met my old enemy, log properties. Thankfully, I took great notes from my previous battle so this confrontation went much smoother. It just goes to show that if you solve a problem once but fail to document the solution you may end up having to solve that same problem again a few weeks later lol. So glad I learned this lesson early on and took notes not matter how messy until they have improved to where it is easy for me to come back to topics and find a previously derived solution.

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 worked on example nine. The problem was pretty interesting and was somewhat associated with example 3 (which I struggled with immensely). The problem used a property of logarithms to prove that the runtime for the recursive function given was in fact O(N) instead of O(base^branches). I still need to write down the process through which this was derived but with simpler steps (since I have struggled with the books math explanations). Overall, I think it will be a good exercise to help me get more comfortable with both calculating recursive runtimes and logarithm properties since they are both still new to me.
• Continued working through the module called “Introduction to Microsoft Power Platform”. I read through a section discussing connectors. I am a bit confused about the costs associated with connectors to 3rd party platforms. I guess I need to get to working on some to truly understand what is required. I am however, proud that I am slowly building a habit out of learning this new topic. The momentum is building.

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!