have this problem-->
http://online-judge.uva.es/p/v1/100.html
can someone help me find the complexity of my solution...i need step by step help how can i find the complexity
thnks in advanceeeeeeeeeeeeeeeeeee
Code:
#include "stdio.h"
void main(){
long n,i,temp,n0,n1,master_number,c=1;
while (scanf("%ld %ld",&n0,&n1)!=EOF)
{
printf ("%ld %ld ",n0,n1);
master_number=1;
if (n0>n1)
{
temp=n0;n0=n1;n1=temp;
}
for (i=n0;i<=n1;i++)
{
c=1;n=i;
while(n>1)
{
n=(n%2)?(3*n+1):(n/2);
c++;
}
if (c>master_number)
{
master_number=c;
}
}
printf ("%ld\n",master_number);
}
}