Time complexity
Time complexity: The efficiency of code Time complexity is one of the main ways algorithms in computer science are analyzed. In general, how efficient an algorithm is is based on the number of elementary operations the algorithm performs. Algorithms simply put are...
Trees: An Overview
Updated: 5/9/2025 Editor’s Note: Looking back at this article, it’s not great. But this was before I knew anything about SEO for blogs. Algorithms are one of the most important topics in Computer Science. An upcoming article involves an Object-Oriented...
Trees
Algorithms are one of the most important topics in Computer Science. An upcoming article involves an Object-Oriented Programming design pattern called the composite design pattern. The composite design pattern involves a data structure called a Tree. A data structure...
The Singleton Pattern
The last blog post was a general overview of the fundamentals of Object-Oriented programming. I would like to go over a specific pattern that commonly appears in software engineering. One of the most common and simplest patterns to understand is the Singleton pattern....