Big O notation explained
I am trying to explain what Big-O notation means for an specific algorithm. Big-O notation is used to describe algorithm's performace and tell you how time needed to execute solution may evolve along with input data size(problem size). You can find code examples for problems having various algorithm complexity in the link to my GitHub repository below. Project is implemented in Java and contains Spock unit tests.
GitHub: https://github.com/slawomirkorbas/exc...
On this page of the site you can watch the video online Big O notation explained with a duration of hours minute second in good quality, which was uploaded by the user Developers Greenfield 23 March 2018, share the link with friends and acquaintances, this video has already been watched 80 times on youtube and it was liked by 1 viewers. Enjoy your viewing!
