O(n) time complexity indicates linear growth where the time taken increases proportionally with the input size, while O(n^2) indicates quadratic growth where the time taken grows with the square of the input size. An example of O(n) is a single loop through an array, while a nested loop through the same array exemplifies O(n^2).