I was breaking down an example Big O runtime question for a Comparison sort and I started to feel the gears turning. Unlike previous questions I had an idea of what was going on. I had looked into comparison sorts on YouTube and although I could not code the multiple different algorithms, I did understand how the optimal solution would have a Big O time of O(n log n). I further wrote out my own paraphrasing of the solution and there were no other hiccups. It felt phenomenal. Not only was I able to comprehend the problem but I was also able walk through how it’s runtime was derived. I decided not to practice coding Comparison sort algorithms since this section of the book is focused solely on Big O notation and not on all the different types of algorithms I should learn.

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 through example eight. Walked through the solution slowly while paraphrasing where I could. It was a great experience and I hope I can get through the rest of the example problems just as smoothly if not smoother.
• Continued working through the module called “Introduction to Microsoft Power Platform”. I hope that a lot of the terms and names of tools I am seeing are repeated later on because these are hard to remember. The names feel generic and yet oddly unique enough to cause me to forget them easily lol.

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!