Big O Notation - O(nlog(n)) vs O(log(n^2))

algorithm: Big O Notation - O(nlog(n)) vs O(log(n^2))

Thanks for taking the time to learn more. In this video I'll go through your question, provide various answers & hopefully this will lead to your solution! Remember to always stay just a little bit crazy like me, and get through to the end resolution.

Don't forget at any stage just hit pause on the video if the question & answers are going too fast.

Content (except music & images) licensed under CC BY-SA meta.stackexchange.com/help/licensing

Just wanted to thank those users featured in this video:
Nawlidge (https://stackoverflow.com/users/74652...
Joonazan (https://stackoverflow.com/users/18766...)
FireFistAce (https://stackoverflow.com/users/36489...)

Trademarks are property of their respective owners.
Disclaimer: All information is provided "AS IS" without warranty of any kind. You are responsible for your own actions.

Please contact me if anything is amiss. I hope you have a wonderful day.

Related to: algorithm, big-o