Quick Big-O question

Posted by timeNomad on Stack Overflow See other posts from Stack Overflow or by timeNomad
Published on 2010-06-05T16:56:39Z Indexed on 2010/06/05 17:02 UTC
Read the original article Hit count: 157

Filed under:
|
int a = 3;
while (a <= n)
  a = a*a;

My version is that its complexity is:

Is there such a thing?

© Stack Overflow or respective owner

Related posts about homework

Related posts about big-o