Constant folding can (theoretically) turn a O(N) loop into constant-time, and may trigger further dead code elimination. Your typical template metaprogram for computing Fibonacci numbers will do the same.
The time when mortals could more or less 'see' what the memory usage and execution time of a C++ code fragment are is well beyond us.
The time when mortals could more or less 'see' what the memory usage and execution time of a C++ code fragment are is well beyond us.