Understanding how the Big O Notation is used to measure algorithm performance.
Big O is a fundamental concept in the field of computer s...
For further actions, you may consider blocking this person and/or reporting abuse
Hello Onyeanuna Prince,
Thank you for your article.
It's easy to read and understand.
I particularly like the diagram regarding Big O notations.
Also, I would have liked to see a simple example of the O(Log N) example, but I understand that the O(Log N) is a bit difficult to explain.
Thank you for reading, and your very honest and beautiful comments, it means alot.
Examples on O(Log N) are quite long and alittle bit complex, adding them here would have overstepped the goal of this article, which is making this subject as simple as possible.
You can also go through some resources on binary search algorithm.
The binary search algorithm is simple.
Basically:
Do this until you run out of an array.
The concept of Log N (base 2, also written Lg N sometimes) is to discard half your problem with each iteration.
For such cases you're problem will grow only logarithmically.
This is perfectly explained!!!
This is amazing 🤩
That's a good breakdown of the subject thanks for sharing.
Thank you Andrew!!
Thanks man this is really helpful :)
Thank you for reading and I'm happy it helped you.
Great article, clean text and easy to understand.
Thanks for this.
You're very welcome. Thank you for reading 😊❤️
Good intro level. Clear.
Thank you very much!!!
Thank you for this! I've recently failed a test regarding some of these concepts, this helps me so much!
You're welcome ☺️
Cornerstone sentence :
Yes!, You are very correct Micheal.
Thank you for this observation ❤️