403,195 views 469 on YTPak
3,681 83

Published on 19 Mar 2013 | over 3 years ago

Get the Code Here: goo.gl/Y3UTH

Welcome to my Big O Notations tutorial. Big O notations are used to measure how well a computer algorithm scales as the amount of data involved increases. It isn't however always a measure of speed as you'll see.

This is a rough overview of Big O and I hope to simplify it rather than get into all of the complexity. I'll specifically cover the following O(1), O(N), O(N^2), O(log N) and O(N log N). Between the video and code below I hope everything is completely understandable.

Loading related videos...