+**Big O** notation describes the performance or complexity of an [Algorithm](/wiki/Algorithm). It quantifies how the [Running Time](/wiki/Running_Time) or space requirements grow as the input size tends towards infinity, providing an upper bound on an algorithm's worst-case behavior.
+## See also
+- [Time Complexity](/wiki/Time_Complexity)
+- [Space Complexity](/wiki/Space_Complexity)
+- [Data Structures](/wiki/Data_Structures)
... 1 more lines