Цитаты из книги Грокаем структуры данных

So, how can we measure algorithm performance? There are two main ways:•Measuring the implementation of an algorithm, running the code on various inputs, and measuring the time and the memory it takes. This is called profiling.•<…>using a simplified model for the machine it would run on and abstracting many details. In this case, we focus on coming up with a mathematical law describing the running time and the memory in terms of the input size. This is called asymptotic analysis.

Encapsulation: A pillar of modern programming

If you are not familiar with composition, inheritance, and their tradeoffs, a good read would be Dane Hillard’s Practices of the Python Pro (Manning, 2019).

they can store fractions, strings, and other types of objects. As an example, how about an array of candies?
An integer array for candies

No one would stop us from doing so (although, hopefully, someone would stop us before we get this mess into production!).

If you are not familiar with an Advent calendar, it’s similar to Advent of Code, except that instead of coding problems, you get a sweet treat every day between the 1st and the 24th of December (funny how the analogy usually works the other way around for everyone except software engineers!).

the drawers that can hold your data from which you can retrieve it.The size of the shelf determines the maximum number of drawers. You can create variables (drawers) of different sizes, as long as they fit into the space of the shelf.

Happy Grokking!—Daniel Zingaro, PhD