Algorithm analysis question in growth of functions
Formally, there is absolutely no way to tell.  O( ) notation is about the limiting behavior of a function (in this case, the running time of an algorithm) as its argument (in this case, the input size) grows to infinity.  Without more information, it is absolutely impossible, even in principle, to predict behavior in the limit from a finite number of function values.