Big O

Explanation: The notation that represents an algorithm's upper bound for time or space complexity. Helps compare the efficiency of algorithms based on their worst-case performance as the input size increases.