Logarithm of N Is the Order of the Number of Elements in a Structure Form of Notation

Othelogarithm of n is always smaller than the value of n, and it increases much more slowly then n itself. That means as data volumes increase, the performance decreases very slowly. The ideal you would want the performance did not decrease at all. Ye, on the other the larger the number, the slower it is. And so if we look at our very first example of the linear search o in bigo notation,. that's bigo of n, or the complexity of searching that element, searching that structure.