Big O notation indicates how good the algorithm scale or performance is in the worst case as the elements of the data structure increase.
Big O notation can also be used to describe other behaviors, such as memory consumption. Because a set is actually a data structure, we generally use Big O notation to choose the best implementation based on time, performance, and memory consumption.
Big O notation can give a good indication of performance on large amounts of data