Big O (Introduction)
If computer C1 running algorithm program A takes T1(n) = c1 n2 milliseconds to reverse a list of n numbers and computer C2 takes twice as long to run the same program then
It’s the same program in each case and so we would like to characterize the running times in a way that makes them equal.
O(T1(n)) = O(T2(n)) = O(n2)