Time complexity

[upper fox]

When your question is answered use !solved to mark the question as resolved.

Remember to ask specific questions, provide necessary details, and reduce your question to its simplest form. For tips on how to ask a good question run !howto ask.

[pine pond]

The time complexity is O(1) because both loops will be optimized away because they do nothing

[novel sedge]

Ok but how about now?

[pine pond]

The time complexity of this is not O(log(log(n)))

It is O(log(n) * log(m))

[novel sedge]

That's what I've asked. Why that instead of this. Please if you don't want to explain don't answer.

[pine pond]

No need to be rude

It isn't O(log^2(n)) either

Well, now it is since you edited it again

[novel sedge]

Now it is. And you are the rude one. Now nobody else's gonna answer to this.

[pine pond]

To understand why, answer two questions:
How many times does the outer loop run?
How many times does the inner loop run?

[pine pond]

Chill, dude. Keep in mind everyone here is volunteering their time to help you understand things more.

[novel sedge]

You're right. I'm sorry.