Landau symbols

Landau symbols, also known as Big O notation, are a way to describe how the running time or space requirements of an algorithm grow as the input size increases. They provide a way to compare the efficiency of different algorithms by focusing on their dominant terms, ignoring constant factors and less significant growth. For example, an algorithm that takes roughly proportional time to the size of the input is called O(n), meaning its performance grows linearly. This helps to understand and predict how well algorithms perform, especially for very large data sets, enabling better decision-making in software development.