[rolandbaker]

Computational complexity is usually described in terms of the size of the input data sets. Is there a formalism that describes complexity when the size of the data set is irrelevant? For example, say I have an algorithm and the number of operations depends only on the value of the variable x. Let's say the number of operations is N = a*x^3 + b*x^2 + c*x^1. Would the complexity be written as O(x^3), or is there another notation for this? Is there a notation that describes linear changes in complexity?

I didn't find the right solution from the Internet.
References http://www.dreamincode.net/forums/topic/401447-complexity-as-a-function-of-a-real-number-big-o-notation/

Transport Management Service Video spamlink removed. Next spam = 100% ban. EDIT: Admin.

[SEO]

What about thinking like this: "Spamlinks as a function of a real ban in seo-forum-seo-luntan.com"?

I am going to delete another spamlink of yours. Avoid spam, because spam leads to ban here.

[MSL]

 And... banned. No complexity.