As we know, there may be more than one solution to any problem. But it is hard to define, what is the best approach and method of solving that prog...
For further actions, you may consider blocking this person and/or reporting abuse
We will never be able to express the complexity of space-time with JavaScript 😄
Thank you Lars, Would you please explain to me why? It will really help me to learn more.
It's a joke 😄 I was referring to space-time.
Thanks that was some nice examples.
I have tried a few times to understand Big-O notation and logarithms, but I never have and don't think I ever will.
Do you know of any resource in particular that helped you?
I have learned from Udemy. Its the best online solution out there.
I think you got a mistake in your article,
You should prefer O(log n) to O(n), it's the principle of binary tree 😁
Yes, thanks Baptiste for the correction. Please have a look at the graph. I think there is a little difference between the two.
Awesome post
Thanks Ynoa