Huh? It's already beyond. :-) Big-O notation is about the behavior of functions as their argument goes to some limit. Sometimes the function of interest is the running time or space requirement of an algorithm, sometimes it's something else, like the asymptotic of a sum.