Hello!

Instead, because that's too pessimistic, we take an average of operation run time of a sequence over that sequence.

Still not fully got that part.

This is why I want to study more Math, but it is really motivating me to do so! [3 / 3]

However, initially I was a little stumped as to why the time complexity is O(n) - at first glance, it looks O(n^2), given the nested while loop.

Reading more closely, this is related to Amortised analysis - where we don't analyse time / space complexity based on worst case scenario. [2 / 3]

Thanks Leah, absolutely :)

Hey Kele!!

yo!

or barking into the void...😂

Love your persistence and growth with these React challenges Chris! Keep it up :)

Pretty fresh start indeed. Seems like X without all the politics and toxicity

Amazing, thanks Stu, I’ll check out these filters and try to tame my feed for tech content.

Cheers Killian I’ll try this out!

What tool you using mate?

Hello Cyril!! 👋

You too! Seems far more relaxed here.

hello....simon holmes (and world!)

Your wife has taste :D