The Big O notation is used to indicate an algorithm’s upper bound or worst-case time complexity. If an algorithm has a time complexity of O( n2), it signifies that its time demand will not grow faster than n2 as the input size rises. In the worst-case situation, the method could take up to n2 operations to complete.