🏃♀️ Navigating Big O: A Journey from O(1) to O(n!) Welcome back to the continuation of our series on Big O! If this is your first blog entry and you're interested in this topic (often out of necessity due to interviews, but interested nonetheless to improve...) you've probably asked yourself some of these questions: ❓ How do software engineers or programmers,
🦁 Conquering the Big-O Beast Now that we have a basic understanding of Big-O notation thanks to the previous post (which I invite you to review), we can start looking for slightly more costly calculations to understand how algorithms are evaluated broadly. Imagine you're organizing a large party and you have a guest list! Each
⏳ Algorithmic Complexity 📖 Introduction Designing and building algorithms is an integral part of software development. While the primary goal of every algorithm is to solve a particular problem, it is essential to consider how an algorithm performs its work and how many resources it needs to do it, as this will ultimately transform