Okay, so prime number algorithms are not as bad as I thought. I went through watching a few videos on prime numbers, the “sieve of Eratosthenes”, and prime number algorithms. Overall it was a swell time and was not too stressful. Feels great to catch a break once in a while. LOL

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. After learning more about Prime numbers and some methods to determine whether a number is a prime number I feel a lot more confident in tackling a question like this if asked during an interview. Interestingly, one thing I am noticing more and more with algorithms and data structures is the importance of math. My guess is that a strong comfort with math will aide anyone in better understanding algorithms and Big O notation especially. It feels like the more I cover this topic the more I feel like I need to go back and review my math.

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!