Need help with Big O notation

I have no problem finding the run time complexity of expressions (such as 5n^5+n^2), but I am having trouble finding the max number of executions in a function. such as

1
2
3
4
void func(int x)
    {
  for(int i=0; i<x; i++)
   cout << i << endl;


in this case the I am looking for the number of operations executed by the function when the value of x is 10. Can someone help me out?
Topic archived. No new replies allowed.