I'm new to this forum so first i want to say warm "Hello" to everyone, and especially to those that will help me (if any)

I have nothing special or very complicated here, i just need to know what will be the computational complexity of the simple algorithm below.

I am almost certain it should be O(N^2), but I just need to make sure.

Code:

int SomeFunction( int VarX ){
int Result = 0;
int Count = 0;
for (int i = 0; i < VarX; i++){
for (int j = 0; j <= 0.7 * VarX; j++){
Result = i + log(j*j);
Count++;
}
}
return 0.3 * Result;
}