I moved on to the next example problem only to hit another mini rabbit hole. I have seen prime number questions in the past but cannot remember how to solve. It’s now or never. I am diving into the concept of a prime number and how to programmatically determine if a number is prime or not.

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 ten. The algorithm is determining whether a number is a prime number or not. I took a guess as to what the Big O calculation would be for it’s runtime. I ended up with the wrong answer and so here we are. I understood the correct answer and the explanation but I did not understand how they came to that conclusion. I feel like I need to learn a bit more about “Prime Numbers” before I move on.
• I started reviewing what I learned in the Microsoft Power Platforms module I am working through. Something is better than nothing in my book.
• Started writing my notes for the proof for example 9 and why Balanced Binary Search Trees have a height equal to O(log(n))

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!